./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:56:09,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:56:09,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:56:09,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:56:09,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:56:09,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:56:09,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:56:09,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:56:09,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:56:09,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:56:09,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:56:09,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:56:09,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:56:09,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:56:09,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:56:09,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:56:09,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:56:09,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:56:09,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:56:09,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:56:09,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:56:09,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:56:09,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:56:09,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:56:09,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:56:09,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:56:09,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:56:09,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:56:09,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:56:09,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:56:09,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:56:09,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:56:09,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:56:09,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:56:09,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:56:09,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:56:09,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:56:09,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:56:09,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:56:09,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:56:09,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:56:09,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:56:09,453 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:56:09,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:56:09,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:56:09,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:56:09,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:56:09,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:56:09,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:56:09,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:56:09,455 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:56:09,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:56:09,456 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:56:09,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:56:09,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:56:09,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:56:09,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:56:09,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:56:09,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:56:09,457 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:56:09,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:56:09,457 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:56:09,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:56:09,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:56:09,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:56:09,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:56:09,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:56:09,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:56:09,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:56:09,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:56:09,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:56:09,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:56:09,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:56:09,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:56:09,459 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:56:09,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:56:09,460 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:56:09,460 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 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 -> BEFORE [2023-09-01 09:56:09,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:56:09,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:56:09,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:56:09,694 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:56:09,694 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:56:09,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:56:10,639 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:56:10,811 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:56:10,811 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:56:10,820 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321926728/8367c5266b63417b97700bdc6683774f/FLAG12f3dcc35 [2023-09-01 09:56:10,830 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321926728/8367c5266b63417b97700bdc6683774f [2023-09-01 09:56:10,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:56:10,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:56:10,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:56:10,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:56:10,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:56:10,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:56:10" (1/1) ... [2023-09-01 09:56:10,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4219da2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:10, skipping insertion in model container [2023-09-01 09:56:10,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:56:10" (1/1) ... [2023-09-01 09:56:10,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:56:10,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:56:10,950 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-09-01 09:56:11,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:56:11,118 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:56:11,126 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-09-01 09:56:11,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:56:11,179 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:56:11,179 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:56:11,184 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:56:11,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11 WrapperNode [2023-09-01 09:56:11,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:56:11,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:56:11,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:56:11,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:56:11,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,242 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-09-01 09:56:11,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:56:11,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:56:11,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:56:11,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:56:11,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:56:11,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:56:11,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:56:11,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:56:11,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (1/1) ... [2023-09-01 09:56:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:56:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:56:11,325 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-09-01 09:56:11,344 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-09-01 09:56:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:56:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:56:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:56:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:56:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:56:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:56:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:56:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:56:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:56:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:56:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:56:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:56:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:56:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:56:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:56:11,357 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:56:11,519 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:56:11,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:56:11,787 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:56:11,879 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:56:11,879 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:56:11,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:56:11 BoogieIcfgContainer [2023-09-01 09:56:11,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:56:11,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:56:11,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:56:11,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:56:11,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:56:10" (1/3) ... [2023-09-01 09:56:11,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f010be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:56:11, skipping insertion in model container [2023-09-01 09:56:11,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:11" (2/3) ... [2023-09-01 09:56:11,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f010be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:56:11, skipping insertion in model container [2023-09-01 09:56:11,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:56:11" (3/3) ... [2023-09-01 09:56:11,887 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:56:11,893 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:56:11,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:56:11,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:56:11,900 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:56:11,959 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:56:11,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-09-01 09:56:12,036 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-09-01 09:56:12,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:56:12,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-09-01 09:56:12,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-09-01 09:56:12,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-09-01 09:56:12,048 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:56:12,062 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-09-01 09:56:12,065 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-09-01 09:56:12,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-09-01 09:56:12,091 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-09-01 09:56:12,092 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:56:12,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-09-01 09:56:12,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-09-01 09:56:14,873 INFO L134 LiptonReduction]: Checked pairs total: 4589 [2023-09-01 09:56:14,873 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-09-01 09:56:14,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:56:14,886 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;@63663124, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:56:14,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:56:14,889 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-09-01 09:56:14,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:56:14,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:14,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:56:14,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:14,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 439113858, now seen corresponding path program 1 times [2023-09-01 09:56:14,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:14,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275765346] [2023-09-01 09:56:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:14,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275765346] [2023-09-01 09:56:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275765346] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:56:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42209462] [2023-09-01 09:56:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:15,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:56:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:56:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:56:15,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 199 [2023-09-01 09:56:15,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-09-01 09:56:15,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:15,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 199 [2023-09-01 09:56:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:15,463 INFO L130 PetriNetUnfolder]: 999/1612 cut-off events. [2023-09-01 09:56:15,464 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-09-01 09:56:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1612 events. 999/1612 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8314 event pairs, 165 based on Foata normal form. 64/1540 useless extension candidates. Maximal degree in co-relation 3136. Up to 1195 conditions per place. [2023-09-01 09:56:15,471 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 29 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-09-01 09:56:15,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2023-09-01 09:56:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:56:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:56:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-09-01 09:56:15,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360134003350083 [2023-09-01 09:56:15,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-09-01 09:56:15,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-09-01 09:56:15,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:15,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-09-01 09:56:15,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-09-01 09:56:15,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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-09-01 09:56:15,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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-09-01 09:56:15,494 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 320 transitions. [2023-09-01 09:56:15,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2023-09-01 09:56:15,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:56:15,497 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-09-01 09:56:15,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-09-01 09:56:15,501 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-09-01 09:56:15,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-09-01 09:56:15,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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-09-01 09:56:15,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:15,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:15,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:56:15,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:15,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1109010607, now seen corresponding path program 1 times [2023-09-01 09:56:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186067915] [2023-09-01 09:56:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:15,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186067915] [2023-09-01 09:56:15,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186067915] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:56:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726210561] [2023-09-01 09:56:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:15,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:15,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-09-01 09:56:15,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:15,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:15,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-09-01 09:56:15,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:16,073 INFO L130 PetriNetUnfolder]: 1359/2089 cut-off events. [2023-09-01 09:56:16,074 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2023-09-01 09:56:16,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 2089 events. 1359/2089 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10774 event pairs, 440 based on Foata normal form. 116/2204 useless extension candidates. Maximal degree in co-relation 4393. Up to 1119 conditions per place. [2023-09-01 09:56:16,080 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 31 selfloop transitions, 5 changer transitions 20/57 dead transitions. [2023-09-01 09:56:16,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 57 transitions, 246 flow [2023-09-01 09:56:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:56:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:56:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-09-01 09:56:16,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005025125628141 [2023-09-01 09:56:16,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-09-01 09:56:16,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-09-01 09:56:16,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:16,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-09-01 09:56:16,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 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-09-01 09:56:16,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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-09-01 09:56:16,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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-09-01 09:56:16,087 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 498 transitions. [2023-09-01 09:56:16,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 57 transitions, 246 flow [2023-09-01 09:56:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:16,088 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 87 flow [2023-09-01 09:56:16,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-09-01 09:56:16,089 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-09-01 09:56:16,089 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 87 flow [2023-09-01 09:56:16,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:16,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:16,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:16,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:56:16,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:16,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash -19596884, now seen corresponding path program 1 times [2023-09-01 09:56:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:16,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120507646] [2023-09-01 09:56:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120507646] [2023-09-01 09:56:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120507646] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624566967] [2023-09-01 09:56:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:16,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:56:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:16,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:56:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:56:16,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-09-01 09:56:16,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:56:16,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:16,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-09-01 09:56:16,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:16,482 INFO L130 PetriNetUnfolder]: 1213/1890 cut-off events. [2023-09-01 09:56:16,482 INFO L131 PetriNetUnfolder]: For 815/815 co-relation queries the response was YES. [2023-09-01 09:56:16,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 1890 events. 1213/1890 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9413 event pairs, 183 based on Foata normal form. 84/1970 useless extension candidates. Maximal degree in co-relation 4856. Up to 872 conditions per place. [2023-09-01 09:56:16,489 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 34 selfloop transitions, 6 changer transitions 22/63 dead transitions. [2023-09-01 09:56:16,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 63 transitions, 320 flow [2023-09-01 09:56:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:56:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:56:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2023-09-01 09:56:16,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4881550610193826 [2023-09-01 09:56:16,491 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2023-09-01 09:56:16,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2023-09-01 09:56:16,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:16,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2023-09-01 09:56:16,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 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-09-01 09:56:16,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:16,502 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:16,502 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 87 flow. Second operand 7 states and 680 transitions. [2023-09-01 09:56:16,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 63 transitions, 320 flow [2023-09-01 09:56:16,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 63 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:16,508 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 112 flow [2023-09-01 09:56:16,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-09-01 09:56:16,508 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-09-01 09:56:16,509 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 112 flow [2023-09-01 09:56:16,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:56:16,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:16,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:16,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:56:16,510 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:16,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash -19595923, now seen corresponding path program 1 times [2023-09-01 09:56:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287736554] [2023-09-01 09:56:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287736554] [2023-09-01 09:56:16,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287736554] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:16,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:16,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354720206] [2023-09-01 09:56:16,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:16,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:56:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:56:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:56:16,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-09-01 09:56:16,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:56:16,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:16,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-09-01 09:56:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:16,877 INFO L130 PetriNetUnfolder]: 1161/1819 cut-off events. [2023-09-01 09:56:16,877 INFO L131 PetriNetUnfolder]: For 2622/2622 co-relation queries the response was YES. [2023-09-01 09:56:16,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5159 conditions, 1819 events. 1161/1819 cut-off events. For 2622/2622 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9057 event pairs, 239 based on Foata normal form. 100/1918 useless extension candidates. Maximal degree in co-relation 5141. Up to 962 conditions per place. [2023-09-01 09:56:16,884 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 36 selfloop transitions, 7 changer transitions 22/66 dead transitions. [2023-09-01 09:56:16,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 373 flow [2023-09-01 09:56:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:56:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:56:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2023-09-01 09:56:16,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49030868628858576 [2023-09-01 09:56:16,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2023-09-01 09:56:16,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2023-09-01 09:56:16,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:16,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2023-09-01 09:56:16,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 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-09-01 09:56:16,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:16,890 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:16,891 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 112 flow. Second operand 7 states and 683 transitions. [2023-09-01 09:56:16,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 373 flow [2023-09-01 09:56:16,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 343 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-09-01 09:56:16,897 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 127 flow [2023-09-01 09:56:16,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2023-09-01 09:56:16,897 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-09-01 09:56:16,898 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 127 flow [2023-09-01 09:56:16,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-09-01 09:56:16,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:16,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:16,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:56:16,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:16,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash -607508878, now seen corresponding path program 1 times [2023-09-01 09:56:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:16,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569431541] [2023-09-01 09:56:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:16,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:16,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:16,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569431541] [2023-09-01 09:56:16,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569431541] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:16,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:16,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:16,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105934390] [2023-09-01 09:56:16,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:16,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:56:16,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:16,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:56:16,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:56:17,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-09-01 09:56:17,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 26 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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-09-01 09:56:17,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:17,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-09-01 09:56:17,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:17,292 INFO L130 PetriNetUnfolder]: 1577/2425 cut-off events. [2023-09-01 09:56:17,292 INFO L131 PetriNetUnfolder]: For 3828/3828 co-relation queries the response was YES. [2023-09-01 09:56:17,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7133 conditions, 2425 events. 1577/2425 cut-off events. For 3828/3828 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11772 event pairs, 204 based on Foata normal form. 100/2525 useless extension candidates. Maximal degree in co-relation 7114. Up to 808 conditions per place. [2023-09-01 09:56:17,301 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 54 selfloop transitions, 18 changer transitions 30/102 dead transitions. [2023-09-01 09:56:17,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 102 transitions, 658 flow [2023-09-01 09:56:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:56:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:56:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2023-09-01 09:56:17,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852037967615857 [2023-09-01 09:56:17,303 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2023-09-01 09:56:17,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2023-09-01 09:56:17,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:17,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2023-09-01 09:56:17,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:17,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 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-09-01 09:56:17,307 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 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-09-01 09:56:17,307 INFO L175 Difference]: Start difference. First operand has 44 places, 26 transitions, 127 flow. Second operand 9 states and 869 transitions. [2023-09-01 09:56:17,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 102 transitions, 658 flow [2023-09-01 09:56:17,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 596 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-09-01 09:56:17,316 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 297 flow [2023-09-01 09:56:17,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-09-01 09:56:17,317 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-09-01 09:56:17,317 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 297 flow [2023-09-01 09:56:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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-09-01 09:56:17,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:17,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:56:17,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:17,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -923860468, now seen corresponding path program 2 times [2023-09-01 09:56:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726558436] [2023-09-01 09:56:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726558436] [2023-09-01 09:56:17,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726558436] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:17,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:17,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:56:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561965290] [2023-09-01 09:56:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:17,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:56:17,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:56:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:56:17,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-09-01 09:56:17,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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-09-01 09:56:17,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:17,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-09-01 09:56:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:17,753 INFO L130 PetriNetUnfolder]: 1827/2812 cut-off events. [2023-09-01 09:56:17,753 INFO L131 PetriNetUnfolder]: For 8193/8193 co-relation queries the response was YES. [2023-09-01 09:56:17,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 2812 events. 1827/2812 cut-off events. For 8193/8193 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13905 event pairs, 389 based on Foata normal form. 105/2917 useless extension candidates. Maximal degree in co-relation 9776. Up to 942 conditions per place. [2023-09-01 09:56:17,762 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 39 selfloop transitions, 9 changer transitions 39/87 dead transitions. [2023-09-01 09:56:17,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 730 flow [2023-09-01 09:56:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:56:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:56:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2023-09-01 09:56:17,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-09-01 09:56:17,765 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2023-09-01 09:56:17,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2023-09-01 09:56:17,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:17,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2023-09-01 09:56:17,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 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-09-01 09:56:17,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:17,768 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:17,768 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 297 flow. Second operand 7 states and 672 transitions. [2023-09-01 09:56:17,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 730 flow [2023-09-01 09:56:17,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 688 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-09-01 09:56:17,799 INFO L231 Difference]: Finished difference. Result has 55 places, 28 transitions, 205 flow [2023-09-01 09:56:17,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=55, PETRI_TRANSITIONS=28} [2023-09-01 09:56:17,799 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-09-01 09:56:17,799 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 28 transitions, 205 flow [2023-09-01 09:56:17,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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-09-01 09:56:17,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:17,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:17,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:56:17,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:17,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1694442363, now seen corresponding path program 1 times [2023-09-01 09:56:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413566175] [2023-09-01 09:56:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413566175] [2023-09-01 09:56:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413566175] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:17,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442605919] [2023-09-01 09:56:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:17,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:17,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:56:17,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 28 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:17,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:17,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:56:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:18,128 INFO L130 PetriNetUnfolder]: 555/953 cut-off events. [2023-09-01 09:56:18,129 INFO L131 PetriNetUnfolder]: For 2678/2681 co-relation queries the response was YES. [2023-09-01 09:56:18,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 953 events. 555/953 cut-off events. For 2678/2681 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4476 event pairs, 110 based on Foata normal form. 85/1032 useless extension candidates. Maximal degree in co-relation 3320. Up to 437 conditions per place. [2023-09-01 09:56:18,133 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 49 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2023-09-01 09:56:18,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 509 flow [2023-09-01 09:56:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:56:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:56:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-09-01 09:56:18,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025125628140703 [2023-09-01 09:56:18,135 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-09-01 09:56:18,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-09-01 09:56:18,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:18,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-09-01 09:56:18,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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-09-01 09:56:18,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 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-09-01 09:56:18,137 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 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-09-01 09:56:18,137 INFO L175 Difference]: Start difference. First operand has 55 places, 28 transitions, 205 flow. Second operand 4 states and 400 transitions. [2023-09-01 09:56:18,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 509 flow [2023-09-01 09:56:18,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 390 flow, removed 15 selfloop flow, removed 12 redundant places. [2023-09-01 09:56:18,141 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 172 flow [2023-09-01 09:56:18,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-09-01 09:56:18,142 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-09-01 09:56:18,142 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 172 flow [2023-09-01 09:56:18,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:18,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:18,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:18,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:56:18,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:18,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1754701814, now seen corresponding path program 1 times [2023-09-01 09:56:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403962616] [2023-09-01 09:56:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:18,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:18,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403962616] [2023-09-01 09:56:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403962616] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:56:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089444347] [2023-09-01 09:56:18,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:18,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:56:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:56:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:56:18,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:56:18,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 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-09-01 09:56:18,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:18,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:56:18,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:18,546 INFO L130 PetriNetUnfolder]: 271/510 cut-off events. [2023-09-01 09:56:18,546 INFO L131 PetriNetUnfolder]: For 569/570 co-relation queries the response was YES. [2023-09-01 09:56:18,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 510 events. 271/510 cut-off events. For 569/570 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2152 event pairs, 49 based on Foata normal form. 52/557 useless extension candidates. Maximal degree in co-relation 1777. Up to 195 conditions per place. [2023-09-01 09:56:18,549 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 53 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2023-09-01 09:56:18,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 465 flow [2023-09-01 09:56:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:56:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:56:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-09-01 09:56:18,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005025125628141 [2023-09-01 09:56:18,552 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-09-01 09:56:18,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-09-01 09:56:18,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:18,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-09-01 09:56:18,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 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-09-01 09:56:18,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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-09-01 09:56:18,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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-09-01 09:56:18,555 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 172 flow. Second operand 5 states and 498 transitions. [2023-09-01 09:56:18,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 465 flow [2023-09-01 09:56:18,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 446 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 09:56:18,558 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 205 flow [2023-09-01 09:56:18,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-09-01 09:56:18,561 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-09-01 09:56:18,561 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 205 flow [2023-09-01 09:56:18,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 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-09-01 09:56:18,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:18,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:18,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:56:18,562 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:18,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1646800473, now seen corresponding path program 1 times [2023-09-01 09:56:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:18,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15435888] [2023-09-01 09:56:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15435888] [2023-09-01 09:56:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15435888] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:18,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:56:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755215219] [2023-09-01 09:56:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:18,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:56:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:18,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:56:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:56:18,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:56:18,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 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-09-01 09:56:18,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:18,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:56:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:19,006 INFO L130 PetriNetUnfolder]: 172/329 cut-off events. [2023-09-01 09:56:19,006 INFO L131 PetriNetUnfolder]: For 570/570 co-relation queries the response was YES. [2023-09-01 09:56:19,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 329 events. 172/329 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1205 event pairs, 47 based on Foata normal form. 16/340 useless extension candidates. Maximal degree in co-relation 1256. Up to 121 conditions per place. [2023-09-01 09:56:19,008 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 35 selfloop transitions, 11 changer transitions 7/57 dead transitions. [2023-09-01 09:56:19,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 423 flow [2023-09-01 09:56:19,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:56:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:56:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2023-09-01 09:56:19,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849246231155779 [2023-09-01 09:56:19,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 579 transitions. [2023-09-01 09:56:19,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 579 transitions. [2023-09-01 09:56:19,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:19,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 579 transitions. [2023-09-01 09:56:19,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 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-09-01 09:56:19,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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-09-01 09:56:19,016 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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-09-01 09:56:19,016 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 205 flow. Second operand 6 states and 579 transitions. [2023-09-01 09:56:19,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 423 flow [2023-09-01 09:56:19,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 388 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-09-01 09:56:19,020 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 212 flow [2023-09-01 09:56:19,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2023-09-01 09:56:19,021 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-09-01 09:56:19,021 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 212 flow [2023-09-01 09:56:19,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 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-09-01 09:56:19,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:19,022 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-09-01 09:56:19,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:56:19,022 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:19,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1975946977, now seen corresponding path program 1 times [2023-09-01 09:56:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:19,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209839202] [2023-09-01 09:56:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:19,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209839202] [2023-09-01 09:56:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209839202] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:56:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373784311] [2023-09-01 09:56:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:19,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:56:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:56:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:56:19,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-09-01 09:56:19,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 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-09-01 09:56:19,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:19,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-09-01 09:56:19,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:19,302 INFO L130 PetriNetUnfolder]: 176/339 cut-off events. [2023-09-01 09:56:19,303 INFO L131 PetriNetUnfolder]: For 623/627 co-relation queries the response was YES. [2023-09-01 09:56:19,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 339 events. 176/339 cut-off events. For 623/627 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1278 event pairs, 35 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 1313. Up to 199 conditions per place. [2023-09-01 09:56:19,304 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 30 selfloop transitions, 4 changer transitions 20/55 dead transitions. [2023-09-01 09:56:19,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 444 flow [2023-09-01 09:56:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:56:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:56:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-09-01 09:56:19,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-09-01 09:56:19,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-09-01 09:56:19,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-09-01 09:56:19,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:19,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-09-01 09:56:19,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 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-09-01 09:56:19,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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-09-01 09:56:19,308 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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-09-01 09:56:19,309 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 212 flow. Second operand 5 states and 480 transitions. [2023-09-01 09:56:19,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 444 flow [2023-09-01 09:56:19,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 323 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-09-01 09:56:19,312 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 118 flow [2023-09-01 09:56:19,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-09-01 09:56:19,313 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-09-01 09:56:19,313 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 118 flow [2023-09-01 09:56:19,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 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-09-01 09:56:19,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:19,314 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-09-01 09:56:19,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:56:19,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:19,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1262763627, now seen corresponding path program 2 times [2023-09-01 09:56:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:19,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874684139] [2023-09-01 09:56:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874684139] [2023-09-01 09:56:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874684139] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:56:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066548717] [2023-09-01 09:56:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:20,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:56:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:56:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:56:20,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 199 [2023-09-01 09:56:20,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 118 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 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-09-01 09:56:20,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:20,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 199 [2023-09-01 09:56:20,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:20,174 INFO L130 PetriNetUnfolder]: 56/130 cut-off events. [2023-09-01 09:56:20,174 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-09-01 09:56:20,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 130 events. 56/130 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 352 event pairs, 14 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 397. Up to 68 conditions per place. [2023-09-01 09:56:20,175 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 29 selfloop transitions, 3 changer transitions 18/52 dead transitions. [2023-09-01 09:56:20,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 316 flow [2023-09-01 09:56:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:56:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:56:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2023-09-01 09:56:20,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737975592246949 [2023-09-01 09:56:20,177 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2023-09-01 09:56:20,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2023-09-01 09:56:20,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:20,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2023-09-01 09:56:20,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:20,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:20,180 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-09-01 09:56:20,180 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 118 flow. Second operand 7 states and 660 transitions. [2023-09-01 09:56:20,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 316 flow [2023-09-01 09:56:20,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 259 flow, removed 7 selfloop flow, removed 12 redundant places. [2023-09-01 09:56:20,181 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 93 flow [2023-09-01 09:56:20,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=93, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-09-01 09:56:20,181 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-09-01 09:56:20,181 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 93 flow [2023-09-01 09:56:20,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 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-09-01 09:56:20,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:20,182 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-09-01 09:56:20,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:56:20,182 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:56:20,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1551948531, now seen corresponding path program 3 times [2023-09-01 09:56:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364578089] [2023-09-01 09:56:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:56:20,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:56:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:56:20,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:56:20,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:56:20,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:56:20,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:56:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:56:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:56:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:56:20,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:56:20,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:56:20,290 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:20,293 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:56:20,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:56:20,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:56:20 BasicIcfg [2023-09-01 09:56:20,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:56:20,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:56:20,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:56:20,337 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:56:20,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:56:11" (3/4) ... [2023-09-01 09:56:20,339 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:56:20,413 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:56:20,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:56:20,413 INFO L158 Benchmark]: Toolchain (without parser) took 9580.87ms. Allocated memory was 75.5MB in the beginning and 302.0MB in the end (delta: 226.5MB). Free memory was 52.4MB in the beginning and 204.1MB in the end (delta: -151.6MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,414 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:56:20,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.17ms. Allocated memory is still 75.5MB. Free memory was 52.2MB in the beginning and 49.4MB in the end (delta: 2.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.91ms. Allocated memory is still 75.5MB. Free memory was 49.4MB in the beginning and 47.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,415 INFO L158 Benchmark]: Boogie Preprocessor took 29.94ms. Allocated memory is still 75.5MB. Free memory was 47.0MB in the beginning and 45.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,415 INFO L158 Benchmark]: RCFGBuilder took 606.53ms. Allocated memory is still 75.5MB. Free memory was 45.2MB in the beginning and 37.1MB in the end (delta: 8.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,415 INFO L158 Benchmark]: TraceAbstraction took 8453.83ms. Allocated memory was 75.5MB in the beginning and 302.0MB in the end (delta: 226.5MB). Free memory was 36.8MB in the beginning and 214.5MB in the end (delta: -177.8MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,416 INFO L158 Benchmark]: Witness Printer took 76.47ms. Allocated memory is still 302.0MB. Free memory was 214.5MB in the beginning and 204.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-09-01 09:56:20,417 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.14ms. Allocated memory is still 60.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.17ms. Allocated memory is still 75.5MB. Free memory was 52.2MB in the beginning and 49.4MB in the end (delta: 2.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.91ms. Allocated memory is still 75.5MB. Free memory was 49.4MB in the beginning and 47.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.94ms. Allocated memory is still 75.5MB. Free memory was 47.0MB in the beginning and 45.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.53ms. Allocated memory is still 75.5MB. Free memory was 45.2MB in the beginning and 37.1MB in the end (delta: 8.1MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8453.83ms. Allocated memory was 75.5MB in the beginning and 302.0MB in the end (delta: 226.5MB). Free memory was 36.8MB in the beginning and 214.5MB in the end (delta: -177.8MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 76.47ms. Allocated memory is still 302.0MB. Free memory was 214.5MB in the beginning and 204.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 112 PlacesBefore, 34 PlacesAfterwards, 104 TransitionsBefore, 25 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 4589 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2386, independent: 2233, independent conditional: 0, independent unconditional: 2233, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 982, independent: 949, independent conditional: 0, independent unconditional: 949, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2386, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 982, unknown conditional: 0, unknown unconditional: 982] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-1, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=1, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: 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: 832]: 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: 834]: 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: 836]: 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, 133 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: 8.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 262 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1159 IncrementalHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 62 mSDtfsCounter, 1159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-09-01 09:56:20,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE