./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.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/mix055_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --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:52:48,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:52:48,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:52:48,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:52:48,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:52:48,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:52:48,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:52:48,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:52:48,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:52:48,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:52:48,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:52:48,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:52:48,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:52:48,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:52:48,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:52:48,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:52:48,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:52:48,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:52:48,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:52:48,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:52:48,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:52:48,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:52:48,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:52:48,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:52:48,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:52:48,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:52:48,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:52:48,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:52:48,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:52:48,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:52:48,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:52:48,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:52:48,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:52:48,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:52:48,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:52:48,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:52:48,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:52:48,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:52:48,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:52:48,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:52:48,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:52:48,553 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:52:48,588 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:52:48,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:52:48,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:52:48,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:52:48,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:52:48,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:52:48,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:52:48,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:52:48,592 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:52:48,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:52:48,593 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:52:48,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:52:48,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:52:48,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:52:48,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:52:48,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:52:48,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:52:48,594 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:52:48,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:52:48,595 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:52:48,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:52:48,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:52:48,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:52:48,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:52:48,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:48,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:52:48,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:52:48,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:52:48,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:52:48,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:52:48,597 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:52:48,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:52:48,597 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:52:48,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:52:48,598 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:52:48,598 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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 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:52:48,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:52:48,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:52:48,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:52:48,905 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:52:48,906 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:52:48,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:52:49,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:52:50,256 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:52:50,256 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:52:50,272 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9bf21dc/bde8e378b29848c483ad23a6105892a3/FLAG56f527eb8 [2023-08-30 16:52:50,292 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9bf21dc/bde8e378b29848c483ad23a6105892a3 [2023-08-30 16:52:50,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:52:50,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:52:50,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:52:50,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:52:50,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:52:50,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304c9c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50, skipping insertion in model container [2023-08-30 16:52:50,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:50,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:52:50,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:52:50,528 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:52:50,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:52:50,768 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:52:50,783 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:52:50,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:52:50,927 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:52:50,927 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:52:50,933 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:52:50,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50 WrapperNode [2023-08-30 16:52:50,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:52:50,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:52:50,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:52:50,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:52:50,940 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:52:50" (1/1) ... [2023-08-30 16:52:50,969 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:52:50" (1/1) ... [2023-08-30 16:52:50,995 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-30 16:52:50,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:52:50,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:52:50,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:52:51,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:52:51,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:52:51,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:52:51,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:52:51,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:52:51,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (1/1) ... [2023-08-30 16:52:51,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:52:51,094 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:52:51,124 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:52:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:52:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:52:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:52:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:52:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:52:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:52:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:52:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:52:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:52:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:52:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:52:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:52:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:52:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:52:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:52:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:52:51,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:52:51,157 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:52:51,310 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:52:51,312 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:52:51,654 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:52:51,797 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:52:51,798 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:52:51,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:51 BoogieIcfgContainer [2023-08-30 16:52:51,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:52:51,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:52:51,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:52:51,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:52:51,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:52:50" (1/3) ... [2023-08-30 16:52:51,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dcbdd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:52:51, skipping insertion in model container [2023-08-30 16:52:51,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:50" (2/3) ... [2023-08-30 16:52:51,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dcbdd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:52:51, skipping insertion in model container [2023-08-30 16:52:51,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:51" (3/3) ... [2023-08-30 16:52:51,809 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:52:51,816 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:52:51,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:52:51,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:52:51,824 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:52:51,888 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:52:51,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-08-30 16:52:51,981 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-08-30 16:52:51,981 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:51,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 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/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:52:51,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-08-30 16:52:51,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:51,997 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:52:52,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:52,015 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:52,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-08-30 16:52:52,064 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-08-30 16:52:52,065 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:52,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 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/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:52:52,069 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-08-30 16:52:55,800 INFO L134 LiptonReduction]: Checked pairs total: 8550 [2023-08-30 16:52:55,800 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-30 16:52:55,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:52:55,816 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;@4cf1ef2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:52:55,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:52:55,819 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:52:55,819 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:55,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:55,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:52:55,820 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:52:55,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash 539820, now seen corresponding path program 1 times [2023-08-30 16:52:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970225841] [2023-08-30 16:52:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:56,214 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:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970225841] [2023-08-30 16:52:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970225841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:56,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:52:56,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031170873] [2023-08-30 16:52:56,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:52:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:56,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:52:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:52:56,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 234 [2023-08-30 16:52:56,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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:56,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:56,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 234 [2023-08-30 16:52:56,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:57,228 INFO L130 PetriNetUnfolder]: 4903/7118 cut-off events. [2023-08-30 16:52:57,228 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-08-30 16:52:57,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 7118 events. 4903/7118 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41812 event pairs, 895 based on Foata normal form. 0/6793 useless extension candidates. Maximal degree in co-relation 13954. Up to 5335 conditions per place. [2023-08-30 16:52:57,272 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-30 16:52:57,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-08-30 16:52:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:52:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:52:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-30 16:52:57,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2023-08-30 16:52:57,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-30 16:52:57,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-30 16:52:57,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:57,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-30 16:52:57,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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:57,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:57,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:57,312 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 384 transitions. [2023-08-30 16:52:57,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-08-30 16:52:57,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:52:57,319 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-30 16:52:57,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:52:57,324 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 16:52:57,325 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-30 16:52:57,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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:57,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:57,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:57,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:52:57,329 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:52:57,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1961823611, now seen corresponding path program 1 times [2023-08-30 16:52:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114027274] [2023-08-30 16:52:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:57,670 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:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114027274] [2023-08-30 16:52:57,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114027274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:57,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:57,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:52:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606677437] [2023-08-30 16:52:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:52:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:52:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:52:57,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 234 [2023-08-30 16:52:57,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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:57,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:57,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 234 [2023-08-30 16:52:57,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:59,566 INFO L130 PetriNetUnfolder]: 13646/18640 cut-off events. [2023-08-30 16:52:59,567 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2023-08-30 16:52:59,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38657 conditions, 18640 events. 13646/18640 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 98015 event pairs, 4702 based on Foata normal form. 529/19169 useless extension candidates. Maximal degree in co-relation 38647. Up to 10935 conditions per place. [2023-08-30 16:52:59,665 INFO L137 encePairwiseOnDemand]: 226/234 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-30 16:52:59,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-08-30 16:52:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:52:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:52:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-30 16:52:59,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156695156695157 [2023-08-30 16:52:59,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-30 16:52:59,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-30 16:52:59,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:59,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-30 16:52:59,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:59,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:59,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:59,671 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 362 transitions. [2023-08-30 16:52:59,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-08-30 16:52:59,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:52:59,673 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-08-30 16:52:59,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-30 16:52:59,675 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-30 16:52:59,675 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-08-30 16:52:59,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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:59,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:59,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:59,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:52:59,677 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:52:59,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash -686991959, now seen corresponding path program 1 times [2023-08-30 16:52:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142232474] [2023-08-30 16:52:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:59,903 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:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:59,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142232474] [2023-08-30 16:52:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142232474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:52:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431104505] [2023-08-30 16:52:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:59,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:52:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:52:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:52:59,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 234 [2023-08-30 16:52:59,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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:59,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:59,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 234 [2023-08-30 16:52:59,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:01,606 INFO L130 PetriNetUnfolder]: 11779/16439 cut-off events. [2023-08-30 16:53:01,606 INFO L131 PetriNetUnfolder]: For 5609/5624 co-relation queries the response was YES. [2023-08-30 16:53:01,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39556 conditions, 16439 events. 11779/16439 cut-off events. For 5609/5624 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 90815 event pairs, 2934 based on Foata normal form. 30/16185 useless extension candidates. Maximal degree in co-relation 39544. Up to 14814 conditions per place. [2023-08-30 16:53:01,698 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 39 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-30 16:53:01,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 252 flow [2023-08-30 16:53:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-30 16:53:01,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2023-08-30 16:53:01,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-30 16:53:01,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-30 16:53:01,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:01,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-30 16:53:01,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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:53:01,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:53:01,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:53:01,704 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 3 states and 369 transitions. [2023-08-30 16:53:01,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 252 flow [2023-08-30 16:53:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:01,732 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 143 flow [2023-08-30 16:53:01,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-30 16:53:01,733 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-08-30 16:53:01,736 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 143 flow [2023-08-30 16:53:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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:53:01,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:01,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:53:01,737 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:53:01,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash -686991339, now seen corresponding path program 1 times [2023-08-30 16:53:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:01,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156021204] [2023-08-30 16:53:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:01,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:01,929 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:53:01,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156021204] [2023-08-30 16:53:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156021204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:01,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:53:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384173073] [2023-08-30 16:53:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:01,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:01,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:01,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 234 [2023-08-30 16:53:01,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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:53:01,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:01,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 234 [2023-08-30 16:53:01,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:03,595 INFO L130 PetriNetUnfolder]: 11428/16131 cut-off events. [2023-08-30 16:53:03,595 INFO L131 PetriNetUnfolder]: For 4620/4719 co-relation queries the response was YES. [2023-08-30 16:53:03,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38360 conditions, 16131 events. 11428/16131 cut-off events. For 4620/4719 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 90559 event pairs, 4472 based on Foata normal form. 75/16104 useless extension candidates. Maximal degree in co-relation 38347. Up to 14758 conditions per place. [2023-08-30 16:53:03,713 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-30 16:53:03,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 320 flow [2023-08-30 16:53:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-30 16:53:03,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327635327635327 [2023-08-30 16:53:03,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-30 16:53:03,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-30 16:53:03,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:03,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-30 16:53:03,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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:53:03,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:53:03,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:53:03,720 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 143 flow. Second operand 3 states and 374 transitions. [2023-08-30 16:53:03,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 320 flow [2023-08-30 16:53:03,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:03,722 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 179 flow [2023-08-30 16:53:03,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2023-08-30 16:53:03,723 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-30 16:53:03,723 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 179 flow [2023-08-30 16:53:03,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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:53:03,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:03,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:03,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:53:03,724 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:53:03,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 178084209, now seen corresponding path program 1 times [2023-08-30 16:53:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:03,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044346580] [2023-08-30 16:53:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:03,985 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:53:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044346580] [2023-08-30 16:53:03,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044346580] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:03,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:03,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:53:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068503410] [2023-08-30 16:53:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:03,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:04,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-08-30 16:53:04,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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:53:04,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:04,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-08-30 16:53:04,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:05,059 INFO L130 PetriNetUnfolder]: 8671/12753 cut-off events. [2023-08-30 16:53:05,059 INFO L131 PetriNetUnfolder]: For 6086/6552 co-relation queries the response was YES. [2023-08-30 16:53:05,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31179 conditions, 12753 events. 8671/12753 cut-off events. For 6086/6552 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 77836 event pairs, 1441 based on Foata normal form. 1085/13581 useless extension candidates. Maximal degree in co-relation 31164. Up to 8036 conditions per place. [2023-08-30 16:53:05,148 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 88 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2023-08-30 16:53:05,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 108 transitions, 629 flow [2023-08-30 16:53:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:53:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:53:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-30 16:53:05,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188034188034188 [2023-08-30 16:53:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-30 16:53:05,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-30 16:53:05,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:05,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-30 16:53:05,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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:53:05,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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:53:05,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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:53:05,156 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 179 flow. Second operand 5 states and 607 transitions. [2023-08-30 16:53:05,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 108 transitions, 629 flow [2023-08-30 16:53:05,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 108 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:05,160 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 249 flow [2023-08-30 16:53:05,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-30 16:53:05,161 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-30 16:53:05,161 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 249 flow [2023-08-30 16:53:05,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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:53:05,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:05,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:05,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:53:05,162 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:53:05,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1719906742, now seen corresponding path program 1 times [2023-08-30 16:53:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147626112] [2023-08-30 16:53:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:05,330 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:53:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147626112] [2023-08-30 16:53:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147626112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950230906] [2023-08-30 16:53:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:05,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:05,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 234 [2023-08-30 16:53:05,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:53:05,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:05,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 234 [2023-08-30 16:53:05,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:06,996 INFO L130 PetriNetUnfolder]: 12932/19054 cut-off events. [2023-08-30 16:53:06,996 INFO L131 PetriNetUnfolder]: For 18456/18692 co-relation queries the response was YES. [2023-08-30 16:53:07,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59634 conditions, 19054 events. 12932/19054 cut-off events. For 18456/18692 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 122029 event pairs, 5593 based on Foata normal form. 306/19073 useless extension candidates. Maximal degree in co-relation 59615. Up to 9828 conditions per place. [2023-08-30 16:53:07,066 INFO L137 encePairwiseOnDemand]: 231/234 looper letters, 63 selfloop transitions, 6 changer transitions 7/82 dead transitions. [2023-08-30 16:53:07,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 545 flow [2023-08-30 16:53:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-30 16:53:07,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356125356125356 [2023-08-30 16:53:07,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-30 16:53:07,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-30 16:53:07,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:07,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-30 16:53:07,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:53:07,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:53:07,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 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:53:07,074 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 249 flow. Second operand 3 states and 376 transitions. [2023-08-30 16:53:07,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 545 flow [2023-08-30 16:53:07,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:07,099 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 252 flow [2023-08-30 16:53:07,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-30 16:53:07,102 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-30 16:53:07,102 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 252 flow [2023-08-30 16:53:07,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:53:07,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:07,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:07,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:53:07,103 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:53:07,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1711837889, now seen corresponding path program 1 times [2023-08-30 16:53:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974767129] [2023-08-30 16:53:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:07,354 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:53:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974767129] [2023-08-30 16:53:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974767129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:07,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:07,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:53:07,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925318769] [2023-08-30 16:53:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:53:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:53:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:53:07,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-08-30 16:53:07,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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:53:07,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:07,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-08-30 16:53:07,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:08,716 INFO L130 PetriNetUnfolder]: 8852/13521 cut-off events. [2023-08-30 16:53:08,717 INFO L131 PetriNetUnfolder]: For 12294/12794 co-relation queries the response was YES. [2023-08-30 16:53:08,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41619 conditions, 13521 events. 8852/13521 cut-off events. For 12294/12794 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 89684 event pairs, 1038 based on Foata normal form. 1026/14280 useless extension candidates. Maximal degree in co-relation 41599. Up to 4562 conditions per place. [2023-08-30 16:53:08,771 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 121 selfloop transitions, 17 changer transitions 3/151 dead transitions. [2023-08-30 16:53:08,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 151 transitions, 1010 flow [2023-08-30 16:53:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-30 16:53:08,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518925518925519 [2023-08-30 16:53:08,774 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-30 16:53:08,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-30 16:53:08,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:08,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-30 16:53:08,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 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:53:08,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 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:53:08,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 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:53:08,780 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 252 flow. Second operand 7 states and 850 transitions. [2023-08-30 16:53:08,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 151 transitions, 1010 flow [2023-08-30 16:53:08,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 151 transitions, 970 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:08,848 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 370 flow [2023-08-30 16:53:08,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-08-30 16:53:08,848 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-08-30 16:53:08,849 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 370 flow [2023-08-30 16:53:08,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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:53:08,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:08,849 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:53:08,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:53:08,850 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:53:08,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -48452008, now seen corresponding path program 1 times [2023-08-30 16:53:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368748870] [2023-08-30 16:53:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:09,074 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:53:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368748870] [2023-08-30 16:53:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368748870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:53:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221495524] [2023-08-30 16:53:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:09,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:09,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 234 [2023-08-30 16:53:09,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 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:53:09,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:09,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 234 [2023-08-30 16:53:09,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:11,129 INFO L130 PetriNetUnfolder]: 14108/20836 cut-off events. [2023-08-30 16:53:11,129 INFO L131 PetriNetUnfolder]: For 48428/48428 co-relation queries the response was YES. [2023-08-30 16:53:11,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77307 conditions, 20836 events. 14108/20836 cut-off events. For 48428/48428 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 132367 event pairs, 1167 based on Foata normal form. 75/20911 useless extension candidates. Maximal degree in co-relation 77283. Up to 11625 conditions per place. [2023-08-30 16:53:11,190 INFO L137 encePairwiseOnDemand]: 225/234 looper letters, 99 selfloop transitions, 22 changer transitions 34/155 dead transitions. [2023-08-30 16:53:11,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 155 transitions, 1346 flow [2023-08-30 16:53:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:53:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:53:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-30 16:53:11,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068376068376068 [2023-08-30 16:53:11,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-30 16:53:11,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-30 16:53:11,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:11,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-30 16:53:11,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 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:53:11,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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:53:11,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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:53:11,197 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 370 flow. Second operand 5 states and 593 transitions. [2023-08-30 16:53:11,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 155 transitions, 1346 flow [2023-08-30 16:53:11,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 155 transitions, 1182 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-08-30 16:53:11,732 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 448 flow [2023-08-30 16:53:11,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2023-08-30 16:53:11,733 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-08-30 16:53:11,733 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 448 flow [2023-08-30 16:53:11,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 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:53:11,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:11,734 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:53:11,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:53:11,734 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:53:11,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash -305823792, now seen corresponding path program 1 times [2023-08-30 16:53:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127704276] [2023-08-30 16:53:11,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:12,006 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:53:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127704276] [2023-08-30 16:53:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127704276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:12,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446316443] [2023-08-30 16:53:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:12,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:12,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-08-30 16:53:12,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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:53:12,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:12,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-08-30 16:53:12,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:12,974 INFO L130 PetriNetUnfolder]: 4951/7829 cut-off events. [2023-08-30 16:53:12,974 INFO L131 PetriNetUnfolder]: For 16287/16532 co-relation queries the response was YES. [2023-08-30 16:53:13,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27226 conditions, 7829 events. 4951/7829 cut-off events. For 16287/16532 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 49696 event pairs, 899 based on Foata normal form. 482/8170 useless extension candidates. Maximal degree in co-relation 27199. Up to 2641 conditions per place. [2023-08-30 16:53:13,018 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 114 selfloop transitions, 18 changer transitions 37/185 dead transitions. [2023-08-30 16:53:13,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 185 transitions, 1574 flow [2023-08-30 16:53:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:53:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:53:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-08-30 16:53:13,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207570207570208 [2023-08-30 16:53:13,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-08-30 16:53:13,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-08-30 16:53:13,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:13,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-08-30 16:53:13,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 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:53:13,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 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:53:13,027 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 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:53:13,027 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 448 flow. Second operand 7 states and 853 transitions. [2023-08-30 16:53:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 185 transitions, 1574 flow [2023-08-30 16:53:13,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 185 transitions, 1536 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-30 16:53:13,066 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 572 flow [2023-08-30 16:53:13,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2023-08-30 16:53:13,067 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-08-30 16:53:13,067 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 572 flow [2023-08-30 16:53:13,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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:53:13,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:13,068 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] [2023-08-30 16:53:13,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:53:13,068 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:53:13,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1373579625, now seen corresponding path program 1 times [2023-08-30 16:53:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335680935] [2023-08-30 16:53:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:13,973 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:53:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335680935] [2023-08-30 16:53:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335680935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:13,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120412125] [2023-08-30 16:53:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:13,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:13,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:14,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 234 [2023-08-30 16:53:14,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 572 flow. Second operand has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 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:53:14,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:14,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 234 [2023-08-30 16:53:14,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:15,739 INFO L130 PetriNetUnfolder]: 10574/16212 cut-off events. [2023-08-30 16:53:15,739 INFO L131 PetriNetUnfolder]: For 48357/48357 co-relation queries the response was YES. [2023-08-30 16:53:15,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66255 conditions, 16212 events. 10574/16212 cut-off events. For 48357/48357 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 104674 event pairs, 1207 based on Foata normal form. 11/16223 useless extension candidates. Maximal degree in co-relation 66226. Up to 4873 conditions per place. [2023-08-30 16:53:15,796 INFO L137 encePairwiseOnDemand]: 220/234 looper letters, 212 selfloop transitions, 67 changer transitions 69/348 dead transitions. [2023-08-30 16:53:15,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 348 transitions, 3368 flow [2023-08-30 16:53:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:53:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:53:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2023-08-30 16:53:15,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085470085470085 [2023-08-30 16:53:15,800 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2023-08-30 16:53:15,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2023-08-30 16:53:15,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:15,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2023-08-30 16:53:15,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 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:53:15,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 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:53:15,806 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 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:53:15,806 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 572 flow. Second operand 9 states and 1071 transitions. [2023-08-30 16:53:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 348 transitions, 3368 flow [2023-08-30 16:53:16,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 348 transitions, 2915 flow, removed 184 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:16,347 INFO L231 Difference]: Finished difference. Result has 76 places, 115 transitions, 1100 flow [2023-08-30 16:53:16,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=76, PETRI_TRANSITIONS=115} [2023-08-30 16:53:16,347 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-08-30 16:53:16,347 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 115 transitions, 1100 flow [2023-08-30 16:53:16,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 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:53:16,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:16,348 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] [2023-08-30 16:53:16,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:53:16,349 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:53:16,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1167659281, now seen corresponding path program 2 times [2023-08-30 16:53:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420580054] [2023-08-30 16:53:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:16,841 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:53:16,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420580054] [2023-08-30 16:53:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420580054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011908917] [2023-08-30 16:53:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:16,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:16,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:16,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 234 [2023-08-30 16:53:16,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 115 transitions, 1100 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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:53:16,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:16,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 234 [2023-08-30 16:53:16,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:18,547 INFO L130 PetriNetUnfolder]: 9641/15131 cut-off events. [2023-08-30 16:53:18,547 INFO L131 PetriNetUnfolder]: For 52646/52646 co-relation queries the response was YES. [2023-08-30 16:53:18,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69025 conditions, 15131 events. 9641/15131 cut-off events. For 52646/52646 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 100934 event pairs, 1598 based on Foata normal form. 3/15134 useless extension candidates. Maximal degree in co-relation 68990. Up to 6648 conditions per place. [2023-08-30 16:53:18,612 INFO L137 encePairwiseOnDemand]: 220/234 looper letters, 149 selfloop transitions, 80 changer transitions 76/305 dead transitions. [2023-08-30 16:53:18,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 305 transitions, 3033 flow [2023-08-30 16:53:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:53:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:53:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions. [2023-08-30 16:53:18,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018993352326686 [2023-08-30 16:53:18,619 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions. [2023-08-30 16:53:18,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions. [2023-08-30 16:53:18,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:18,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions. [2023-08-30 16:53:18,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 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:53:18,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 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:53:18,625 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 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:53:18,625 INFO L175 Difference]: Start difference. First operand has 76 places, 115 transitions, 1100 flow. Second operand 9 states and 1057 transitions. [2023-08-30 16:53:18,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 305 transitions, 3033 flow [2023-08-30 16:53:19,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 305 transitions, 2972 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-30 16:53:19,153 INFO L231 Difference]: Finished difference. Result has 83 places, 127 transitions, 1392 flow [2023-08-30 16:53:19,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1392, PETRI_PLACES=83, PETRI_TRANSITIONS=127} [2023-08-30 16:53:19,154 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2023-08-30 16:53:19,154 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 127 transitions, 1392 flow [2023-08-30 16:53:19,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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:53:19,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:19,155 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] [2023-08-30 16:53:19,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:53:19,155 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:53:19,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1773949601, now seen corresponding path program 3 times [2023-08-30 16:53:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:19,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450228555] [2023-08-30 16:53:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:19,423 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:53:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450228555] [2023-08-30 16:53:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450228555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:53:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638545982] [2023-08-30 16:53:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:19,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:19,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:19,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 234 [2023-08-30 16:53:19,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 127 transitions, 1392 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 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:53:19,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:19,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 234 [2023-08-30 16:53:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:20,602 INFO L130 PetriNetUnfolder]: 6765/10886 cut-off events. [2023-08-30 16:53:20,602 INFO L131 PetriNetUnfolder]: For 64793/65552 co-relation queries the response was YES. [2023-08-30 16:53:20,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56122 conditions, 10886 events. 6765/10886 cut-off events. For 64793/65552 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 76013 event pairs, 651 based on Foata normal form. 384/11109 useless extension candidates. Maximal degree in co-relation 56088. Up to 4291 conditions per place. [2023-08-30 16:53:20,652 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 102 selfloop transitions, 17 changer transitions 165/303 dead transitions. [2023-08-30 16:53:20,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 303 transitions, 3790 flow [2023-08-30 16:53:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:53:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:53:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 947 transitions. [2023-08-30 16:53:20,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058760683760684 [2023-08-30 16:53:20,656 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 947 transitions. [2023-08-30 16:53:20,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 947 transitions. [2023-08-30 16:53:20,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:20,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 947 transitions. [2023-08-30 16:53:20,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 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:53:20,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 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:53:20,661 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 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:53:20,661 INFO L175 Difference]: Start difference. First operand has 83 places, 127 transitions, 1392 flow. Second operand 8 states and 947 transitions. [2023-08-30 16:53:20,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 303 transitions, 3790 flow [2023-08-30 16:53:21,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 303 transitions, 3498 flow, removed 81 selfloop flow, removed 5 redundant places. [2023-08-30 16:53:21,302 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 779 flow [2023-08-30 16:53:21,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2023-08-30 16:53:21,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2023-08-30 16:53:21,303 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 779 flow [2023-08-30 16:53:21,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 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:53:21,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:21,304 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] [2023-08-30 16:53:21,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:53:21,304 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:53:21,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1068648198, now seen corresponding path program 1 times [2023-08-30 16:53:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:21,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707590136] [2023-08-30 16:53:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:53:21,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:53:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:53:21,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:53:21,436 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:53:21,437 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:53:21,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:53:21,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:53:21,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:53:21,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:53:21,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:53:21,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:53:21,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:53:21,441 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:21,445 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:53:21,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:53:21,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:53:21 BasicIcfg [2023-08-30 16:53:21,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:53:21,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:53:21,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:53:21,517 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:53:21,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:51" (3/4) ... [2023-08-30 16:53:21,519 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:53:21,617 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:53:21,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:53:21,618 INFO L158 Benchmark]: Toolchain (without parser) took 31322.38ms. Allocated memory was 81.8MB in the beginning and 3.7GB in the end (delta: 3.7GB). Free memory was 58.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-08-30 16:53:21,618 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:53:21,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.17ms. Allocated memory is still 81.8MB. Free memory was 58.3MB in the beginning and 53.7MB in the end (delta: 4.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-30 16:53:21,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.05ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:53:21,619 INFO L158 Benchmark]: Boogie Preprocessor took 64.07ms. Allocated memory is still 81.8MB. Free memory was 51.3MB in the beginning and 49.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:53:21,619 INFO L158 Benchmark]: RCFGBuilder took 736.94ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 56.7MB in the end (delta: -7.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-08-30 16:53:21,620 INFO L158 Benchmark]: TraceAbstraction took 29713.60ms. Allocated memory was 81.8MB in the beginning and 3.7GB in the end (delta: 3.7GB). Free memory was 55.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-30 16:53:21,620 INFO L158 Benchmark]: Witness Printer took 100.74ms. Allocated memory is still 3.7GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:53:21,623 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.17ms. Allocated memory is still 81.8MB. Free memory was 58.3MB in the beginning and 53.7MB in the end (delta: 4.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.05ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.07ms. Allocated memory is still 81.8MB. Free memory was 51.3MB in the beginning and 49.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.94ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 56.7MB in the end (delta: -7.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29713.60ms. Allocated memory was 81.8MB in the beginning and 3.7GB in the end (delta: 3.7GB). Free memory was 55.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 100.74ms. Allocated memory is still 3.7GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 15.7MB). 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.8s, 135 PlacesBefore, 42 PlacesAfterwards, 124 TransitionsBefore, 30 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3117, independent: 2883, independent conditional: 0, independent unconditional: 2883, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1643, independent: 1595, independent conditional: 0, independent unconditional: 1595, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3117, independent: 1288, independent conditional: 0, independent unconditional: 1288, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1643, unknown conditional: 0, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-2, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L863] 0 pthread_t t1459; [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1460; [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=1, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] 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_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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: 860]: 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: 862]: 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: 866]: 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: 864]: 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, 164 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: 29.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 65 mSDtfsCounter, 1841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1392occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:53:21,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE