./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix015.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:09:07,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:09:07,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:09:07,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:09:07,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:09:07,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:09:07,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:09:07,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:09:07,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:09:07,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:09:07,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:09:07,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:09:07,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:09:07,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:09:07,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:09:07,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:09:07,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:09:07,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:09:07,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:09:07,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:09:07,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:09:07,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:09:07,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:09:07,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:09:07,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:09:07,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:09:07,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:09:07,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:09:07,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:09:07,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:09:07,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:09:07,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:09:07,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:09:07,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:09:07,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:09:07,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:09:07,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:09:07,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:09:07,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:09:07,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:09:07,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:09:07,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:09:07,363 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:09:07,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:09:07,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:09:07,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:09:07,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:09:07,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:09:07,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:09:07,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:09:07,366 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:09:07,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:09:07,367 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:09:07,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:09:07,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:09:07,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:09:07,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:09:07,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:09:07,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:09:07,368 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:09:07,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:09:07,369 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:09:07,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:09:07,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:09:07,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:09:07,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:09:07,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:09:07,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:09:07,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:09:07,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:09:07,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:09:07,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:09:07,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:09:07,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:09:07,371 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:09:07,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:09:07,371 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:09:07,371 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 -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d 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 -> TOGETHER [2023-08-30 23:09:07,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:09:07,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:09:07,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:09:07,664 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:09:07,664 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:09:07,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.opt.i [2023-08-30 23:09:08,709 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:09:08,986 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:09:08,987 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.opt.i [2023-08-30 23:09:09,010 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43738e98c/b9c3cf922e634a9893ef3aa5a806ca09/FLAGfbc772dd0 [2023-08-30 23:09:09,026 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43738e98c/b9c3cf922e634a9893ef3aa5a806ca09 [2023-08-30 23:09:09,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:09:09,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:09:09,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:09:09,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:09:09,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:09:09,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a42d10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09, skipping insertion in model container [2023-08-30 23:09:09,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:09:09,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:09:09,256 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/mix015.opt.i[944,957] [2023-08-30 23:09:09,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:09:09,484 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:09:09,495 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/mix015.opt.i[944,957] [2023-08-30 23:09:09,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:09:09,592 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:09:09,592 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:09:09,596 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:09:09,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09 WrapperNode [2023-08-30 23:09:09,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:09:09,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:09:09,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:09:09,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:09:09,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,641 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-30 23:09:09,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:09:09,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:09:09,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:09:09,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:09:09,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:09:09,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:09:09,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:09:09,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:09:09,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (1/1) ... [2023-08-30 23:09:09,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:09:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:09:09,702 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 23:09:09,705 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 23:09:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:09:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:09:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:09:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:09:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:09:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:09:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:09:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:09:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:09:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:09:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:09:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:09:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:09:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:09:09,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:09:09,732 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 23:09:09,845 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:09:09,862 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:09:10,235 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:09:10,349 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:09:10,349 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:09:10,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:09:10 BoogieIcfgContainer [2023-08-30 23:09:10,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:09:10,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:09:10,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:09:10,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:09:10,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:09:09" (1/3) ... [2023-08-30 23:09:10,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbc59b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:09:10, skipping insertion in model container [2023-08-30 23:09:10,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:09" (2/3) ... [2023-08-30 23:09:10,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbc59b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:09:10, skipping insertion in model container [2023-08-30 23:09:10,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:09:10" (3/3) ... [2023-08-30 23:09:10,359 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2023-08-30 23:09:10,365 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:09:10,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:09:10,374 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:09:10,374 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:09:10,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:09:10,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2023-08-30 23:09:10,550 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-08-30 23:09:10,550 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:09:10,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-30 23:09:10,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2023-08-30 23:09:10,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-08-30 23:09:10,563 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:09:10,574 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-08-30 23:09:10,578 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-08-30 23:09:10,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-08-30 23:09:10,614 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-08-30 23:09:10,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:09:10,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-30 23:09:10,618 INFO L119 LiptonReduction]: Number of co-enabled transitions 1990 [2023-08-30 23:09:14,031 INFO L134 LiptonReduction]: Checked pairs total: 5055 [2023-08-30 23:09:14,031 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-30 23:09:14,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:09:14,045 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;@456ece5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:09:14,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:09:14,049 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2023-08-30 23:09:14,049 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:09:14,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:14,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:14,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:14,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1035399296, now seen corresponding path program 1 times [2023-08-30 23:09:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342819508] [2023-08-30 23:09:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:14,499 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 23:09:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342819508] [2023-08-30 23:09:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342819508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:14,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:14,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:09:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485298805] [2023-08-30 23:09:14,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:14,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:09:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:09:14,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:09:14,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2023-08-30 23:09:14,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 23:09:14,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:14,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2023-08-30 23:09:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:14,779 INFO L130 PetriNetUnfolder]: 895/1419 cut-off events. [2023-08-30 23:09:14,779 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 23:09:14,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1419 events. 895/1419 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6641 event pairs, 159 based on Foata normal form. 0/1337 useless extension candidates. Maximal degree in co-relation 2791. Up to 1057 conditions per place. [2023-08-30 23:09:14,791 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-30 23:09:14,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2023-08-30 23:09:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:09:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:09:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-30 23:09:14,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260663507109005 [2023-08-30 23:09:14,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-30 23:09:14,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-30 23:09:14,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:14,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-30 23:09:14,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 23:09:14,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 23:09:14,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 23:09:14,824 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 333 transitions. [2023-08-30 23:09:14,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2023-08-30 23:09:14,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:09:14,828 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-30 23:09:14,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 23:09:14,833 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 23:09:14,833 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-30 23:09:14,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 23:09:14,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:14,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:14,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:09:14,838 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:14,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1413631055, now seen corresponding path program 1 times [2023-08-30 23:09:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:14,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667408888] [2023-08-30 23:09:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:15,130 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 23:09:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:15,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667408888] [2023-08-30 23:09:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667408888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:15,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:09:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106304728] [2023-08-30 23:09:15,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:15,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:09:15,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:15,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:09:15,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:09:15,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 211 [2023-08-30 23:09:15,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 23:09:15,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:15,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 211 [2023-08-30 23:09:15,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:15,283 INFO L130 PetriNetUnfolder]: 631/1011 cut-off events. [2023-08-30 23:09:15,283 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-30 23:09:15,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 1011 events. 631/1011 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4375 event pairs, 247 based on Foata normal form. 32/1041 useless extension candidates. Maximal degree in co-relation 2055. Up to 609 conditions per place. [2023-08-30 23:09:15,289 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-30 23:09:15,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2023-08-30 23:09:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:09:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:09:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-30 23:09:15,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181674565560821 [2023-08-30 23:09:15,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-30 23:09:15,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-30 23:09:15,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:15,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-30 23:09:15,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 23:09:15,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 23:09:15,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 23:09:15,296 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 328 transitions. [2023-08-30 23:09:15,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2023-08-30 23:09:15,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:15,298 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-08-30 23:09:15,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 23:09:15,298 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 23:09:15,299 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-08-30 23:09:15,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 23:09:15,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:15,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:15,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:09:15,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:15,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1291408697, now seen corresponding path program 1 times [2023-08-30 23:09:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596395983] [2023-08-30 23:09:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:15,602 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 23:09:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596395983] [2023-08-30 23:09:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596395983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:15,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:09:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512955239] [2023-08-30 23:09:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:15,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:15,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2023-08-30 23:09:15,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 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 23:09:15,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:15,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2023-08-30 23:09:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:15,806 INFO L130 PetriNetUnfolder]: 913/1372 cut-off events. [2023-08-30 23:09:15,807 INFO L131 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2023-08-30 23:09:15,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2969 conditions, 1372 events. 913/1372 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5717 event pairs, 307 based on Foata normal form. 32/1404 useless extension candidates. Maximal degree in co-relation 2958. Up to 933 conditions per place. [2023-08-30 23:09:15,813 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-30 23:09:15,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 161 flow [2023-08-30 23:09:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:09:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:09:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-08-30 23:09:15,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976303317535545 [2023-08-30 23:09:15,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-08-30 23:09:15,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-08-30 23:09:15,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:15,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-08-30 23:09:15,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 23:09:15,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 23:09:15,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 23:09:15,819 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 315 transitions. [2023-08-30 23:09:15,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 161 flow [2023-08-30 23:09:15,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:15,821 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2023-08-30 23:09:15,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-30 23:09:15,822 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-30 23:09:15,825 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2023-08-30 23:09:15,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 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 23:09:15,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:15,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:15,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:09:15,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:15,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1159100728, now seen corresponding path program 1 times [2023-08-30 23:09:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980666807] [2023-08-30 23:09:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:15,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:16,115 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 23:09:16,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980666807] [2023-08-30 23:09:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980666807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:16,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:16,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:09:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090969765] [2023-08-30 23:09:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:16,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:16,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2023-08-30 23:09:16,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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 23:09:16,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:16,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2023-08-30 23:09:16,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:16,313 INFO L130 PetriNetUnfolder]: 479/798 cut-off events. [2023-08-30 23:09:16,313 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2023-08-30 23:09:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 798 events. 479/798 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3504 event pairs, 102 based on Foata normal form. 80/876 useless extension candidates. Maximal degree in co-relation 1834. Up to 438 conditions per place. [2023-08-30 23:09:16,317 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 29 selfloop transitions, 4 changer transitions 21/56 dead transitions. [2023-08-30 23:09:16,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 254 flow [2023-08-30 23:09:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:09:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:09:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-30 23:09:16,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080568720379147 [2023-08-30 23:09:16,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-30 23:09:16,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-30 23:09:16,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:16,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-30 23:09:16,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 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 23:09:16,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:16,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:16,328 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 5 states and 536 transitions. [2023-08-30 23:09:16,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 254 flow [2023-08-30 23:09:16,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:16,331 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 92 flow [2023-08-30 23:09:16,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-30 23:09:16,332 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-08-30 23:09:16,332 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 92 flow [2023-08-30 23:09:16,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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 23:09:16,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:16,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:16,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:09:16,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:16,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1341607674, now seen corresponding path program 1 times [2023-08-30 23:09:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406042005] [2023-08-30 23:09:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:16,612 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 23:09:16,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406042005] [2023-08-30 23:09:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406042005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:16,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:16,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335481236] [2023-08-30 23:09:16,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:16,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:09:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:09:16,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:09:16,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2023-08-30 23:09:16,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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 23:09:16,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:16,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2023-08-30 23:09:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:16,792 INFO L130 PetriNetUnfolder]: 250/456 cut-off events. [2023-08-30 23:09:16,792 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2023-08-30 23:09:16,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 456 events. 250/456 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1809 event pairs, 71 based on Foata normal form. 44/498 useless extension candidates. Maximal degree in co-relation 1293. Up to 151 conditions per place. [2023-08-30 23:09:16,795 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 38 selfloop transitions, 7 changer transitions 21/68 dead transitions. [2023-08-30 23:09:16,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 364 flow [2023-08-30 23:09:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:09:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:09:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 644 transitions. [2023-08-30 23:09:16,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086887835703001 [2023-08-30 23:09:16,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 644 transitions. [2023-08-30 23:09:16,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 644 transitions. [2023-08-30 23:09:16,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:16,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 644 transitions. [2023-08-30 23:09:16,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 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 23:09:16,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 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 23:09:16,803 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 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 23:09:16,803 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 92 flow. Second operand 6 states and 644 transitions. [2023-08-30 23:09:16,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 68 transitions, 364 flow [2023-08-30 23:09:16,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 68 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:16,807 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 142 flow [2023-08-30 23:09:16,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 23:09:16,808 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-08-30 23:09:16,808 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 142 flow [2023-08-30 23:09:16,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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 23:09:16,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:16,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:16,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:09:16,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:16,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:16,809 INFO L85 PathProgramCache]: Analyzing trace with hash -576237505, now seen corresponding path program 1 times [2023-08-30 23:09:16,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:16,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423401815] [2023-08-30 23:09:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:16,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:17,082 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 23:09:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423401815] [2023-08-30 23:09:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423401815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:09:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177775045] [2023-08-30 23:09:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:17,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:09:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:17,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:09:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:09:17,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2023-08-30 23:09:17,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 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 23:09:17,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:17,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2023-08-30 23:09:17,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:17,228 INFO L130 PetriNetUnfolder]: 168/315 cut-off events. [2023-08-30 23:09:17,229 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2023-08-30 23:09:17,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 315 events. 168/315 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1134 event pairs, 68 based on Foata normal form. 11/324 useless extension candidates. Maximal degree in co-relation 943. Up to 129 conditions per place. [2023-08-30 23:09:17,231 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 35 selfloop transitions, 10 changer transitions 11/58 dead transitions. [2023-08-30 23:09:17,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 356 flow [2023-08-30 23:09:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:09:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:09:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2023-08-30 23:09:17,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942450914014895 [2023-08-30 23:09:17,234 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2023-08-30 23:09:17,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2023-08-30 23:09:17,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:17,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2023-08-30 23:09:17,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 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 23:09:17,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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 23:09:17,239 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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 23:09:17,239 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 142 flow. Second operand 7 states and 730 transitions. [2023-08-30 23:09:17,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 356 flow [2023-08-30 23:09:17,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 306 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-30 23:09:17,243 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 136 flow [2023-08-30 23:09:17,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-08-30 23:09:17,243 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2023-08-30 23:09:17,244 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 136 flow [2023-08-30 23:09:17,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 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 23:09:17,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:17,244 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] [2023-08-30 23:09:17,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:09:17,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:17,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2009814169, now seen corresponding path program 1 times [2023-08-30 23:09:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266080976] [2023-08-30 23:09:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:17,563 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 23:09:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266080976] [2023-08-30 23:09:17,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266080976] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:17,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:17,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:09:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61492974] [2023-08-30 23:09:17,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:17,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2023-08-30 23:09:17,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 23:09:17,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:17,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2023-08-30 23:09:17,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:17,684 INFO L130 PetriNetUnfolder]: 249/452 cut-off events. [2023-08-30 23:09:17,684 INFO L131 PetriNetUnfolder]: For 463/463 co-relation queries the response was YES. [2023-08-30 23:09:17,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 452 events. 249/452 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1864 event pairs, 32 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 1315. Up to 261 conditions per place. [2023-08-30 23:09:17,687 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 34 selfloop transitions, 1 changer transitions 20/56 dead transitions. [2023-08-30 23:09:17,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 402 flow [2023-08-30 23:09:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:09:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:09:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2023-08-30 23:09:17,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509478672985782 [2023-08-30 23:09:17,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 430 transitions. [2023-08-30 23:09:17,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions. [2023-08-30 23:09:17,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:17,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions. [2023-08-30 23:09:17,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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 23:09:17,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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 23:09:17,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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 23:09:17,692 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 136 flow. Second operand 4 states and 430 transitions. [2023-08-30 23:09:17,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 402 flow [2023-08-30 23:09:17,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 322 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-30 23:09:17,696 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 105 flow [2023-08-30 23:09:17,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 23:09:17,697 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-30 23:09:17,697 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 105 flow [2023-08-30 23:09:17,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 23:09:17,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:17,698 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] [2023-08-30 23:09:17,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:09:17,698 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:17,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash -985917857, now seen corresponding path program 2 times [2023-08-30 23:09:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604025995] [2023-08-30 23:09:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:17,942 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 23:09:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:17,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604025995] [2023-08-30 23:09:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604025995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:17,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:09:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861217740] [2023-08-30 23:09:17,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:17,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:17,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2023-08-30 23:09:17,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 23:09:17,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:17,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2023-08-30 23:09:17,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:18,070 INFO L130 PetriNetUnfolder]: 249/470 cut-off events. [2023-08-30 23:09:18,071 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2023-08-30 23:09:18,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 470 events. 249/470 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2062 event pairs, 36 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1303. Up to 297 conditions per place. [2023-08-30 23:09:18,073 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 27 selfloop transitions, 1 changer transitions 27/56 dead transitions. [2023-08-30 23:09:18,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 335 flow [2023-08-30 23:09:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:09:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:09:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2023-08-30 23:09:18,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509478672985782 [2023-08-30 23:09:18,075 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 430 transitions. [2023-08-30 23:09:18,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions. [2023-08-30 23:09:18,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:18,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions. [2023-08-30 23:09:18,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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 23:09:18,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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 23:09:18,078 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 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 23:09:18,079 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 105 flow. Second operand 4 states and 430 transitions. [2023-08-30 23:09:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 335 flow [2023-08-30 23:09:18,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:18,081 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 109 flow [2023-08-30 23:09:18,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=102, 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 23:09:18,081 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-08-30 23:09:18,082 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 109 flow [2023-08-30 23:09:18,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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 23:09:18,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:18,082 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] [2023-08-30 23:09:18,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:09:18,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:18,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash 84156541, now seen corresponding path program 3 times [2023-08-30 23:09:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584341218] [2023-08-30 23:09:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:19,397 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 23:09:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584341218] [2023-08-30 23:09:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584341218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:19,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:19,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:09:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49416013] [2023-08-30 23:09:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:19,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:09:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:09:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:09:19,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2023-08-30 23:09:19,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 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 23:09:19,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:19,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2023-08-30 23:09:19,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:19,640 INFO L130 PetriNetUnfolder]: 198/388 cut-off events. [2023-08-30 23:09:19,641 INFO L131 PetriNetUnfolder]: For 365/365 co-relation queries the response was YES. [2023-08-30 23:09:19,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 388 events. 198/388 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1479 event pairs, 68 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1132. Up to 135 conditions per place. [2023-08-30 23:09:19,642 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 24 selfloop transitions, 5 changer transitions 33/64 dead transitions. [2023-08-30 23:09:19,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 409 flow [2023-08-30 23:09:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:09:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:09:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 813 transitions. [2023-08-30 23:09:19,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816350710900474 [2023-08-30 23:09:19,645 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 813 transitions. [2023-08-30 23:09:19,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 813 transitions. [2023-08-30 23:09:19,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:19,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 813 transitions. [2023-08-30 23:09:19,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 0 states have call successors, (0), 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 23:09:19,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 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 23:09:19,651 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 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 23:09:19,652 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 109 flow. Second operand 8 states and 813 transitions. [2023-08-30 23:09:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 409 flow [2023-08-30 23:09:19,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:19,655 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 122 flow [2023-08-30 23:09:19,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-30 23:09:19,656 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-08-30 23:09:19,657 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 122 flow [2023-08-30 23:09:19,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 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 23:09:19,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:19,657 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] [2023-08-30 23:09:19,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:09:19,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:09:19,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1104785557, now seen corresponding path program 4 times [2023-08-30 23:09:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358024669] [2023-08-30 23:09:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:09:19,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:09:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:09:19,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:09:19,784 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:09:19,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:09:19,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:09:19,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:09:19,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:09:19,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:09:19,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:09:19,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:09:19,790 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:19,794 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:09:19,795 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:09:19,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:09:19 BasicIcfg [2023-08-30 23:09:19,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:09:19,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:09:19,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:09:19,875 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:09:19,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:09:10" (3/4) ... [2023-08-30 23:09:19,876 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:09:19,960 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:09:19,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:09:19,961 INFO L158 Benchmark]: Toolchain (without parser) took 10931.64ms. Allocated memory was 62.9MB in the beginning and 226.5MB in the end (delta: 163.6MB). Free memory was 39.1MB in the beginning and 132.1MB in the end (delta: -93.0MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,961 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:09:19,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.09ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 38.9MB in the beginning and 49.5MB in the end (delta: -10.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 81.8MB. Free memory was 49.5MB in the beginning and 46.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,962 INFO L158 Benchmark]: Boogie Preprocessor took 29.35ms. Allocated memory is still 81.8MB. Free memory was 46.6MB in the beginning and 44.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,962 INFO L158 Benchmark]: RCFGBuilder took 679.43ms. Allocated memory is still 81.8MB. Free memory was 44.5MB in the beginning and 31.8MB in the end (delta: 12.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,963 INFO L158 Benchmark]: TraceAbstraction took 9520.31ms. Allocated memory was 81.8MB in the beginning and 226.5MB in the end (delta: 144.7MB). Free memory was 31.3MB in the beginning and 143.6MB in the end (delta: -112.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,963 INFO L158 Benchmark]: Witness Printer took 86.30ms. Allocated memory is still 226.5MB. Free memory was 143.6MB in the beginning and 132.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 23:09:19,965 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.09ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 38.9MB in the beginning and 49.5MB in the end (delta: -10.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 81.8MB. Free memory was 49.5MB in the beginning and 46.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.35ms. Allocated memory is still 81.8MB. Free memory was 46.6MB in the beginning and 44.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 679.43ms. Allocated memory is still 81.8MB. Free memory was 44.5MB in the beginning and 31.8MB in the end (delta: 12.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9520.31ms. Allocated memory was 81.8MB in the beginning and 226.5MB in the end (delta: 144.7MB). Free memory was 31.3MB in the beginning and 143.6MB in the end (delta: -112.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 86.30ms. Allocated memory is still 226.5MB. Free memory was 143.6MB in the beginning and 132.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 118 PlacesBefore, 33 PlacesAfterwards, 110 TransitionsBefore, 24 TransitionsAfterwards, 1990 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 5055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2659, independent: 2478, independent conditional: 0, independent unconditional: 2478, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1078, independent: 1043, independent conditional: 0, independent unconditional: 1043, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2659, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1078, unknown conditional: 0, unknown unconditional: 1078] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=-2, t388={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=-1, t388={5:0}, t389={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 x = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 869 IncrementalHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 25 mSDtfsCounter, 869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 43, 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.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 23:09:19,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE