/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:22:12,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:22:12,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:22:12,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:22:12,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:22:12,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:22:12,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:22:12,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:22:12,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:22:12,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:22:12,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:22:12,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:22:12,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:22:12,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:22:12,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:22:12,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:22:12,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:22:12,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:22:12,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:22:12,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:22:12,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:22:12,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:22:12,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:22:12,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:22:12,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:22:12,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:22:12,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:22:12,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:22:12,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:22:12,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:22:12,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:22:12,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:22:12,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:22:12,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:22:12,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:22:12,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:22:12,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:22:12,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:22:12,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:22:12,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:22:12,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:22:12,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:22:12,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:22:12,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:22:12,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:22:12,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:22:12,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:22:12,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:22:12,171 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:22:12,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:22:12,171 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:22:12,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:22:12,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:22:12,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:12,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:22:12,173 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:22:12,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:22:12,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:22:12,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:22:12,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:22:12,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:22:12,446 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:22:12,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:22:13,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:22:13,867 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:22:13,867 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:22:13,908 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b735de912/15d088394b234e5aa258a956775a6b6f/FLAGab68debe4 [2022-12-05 20:22:14,108 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b735de912/15d088394b234e5aa258a956775a6b6f [2022-12-05 20:22:14,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:22:14,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:22:14,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:14,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:22:14,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:22:14,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751b452e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14, skipping insertion in model container [2022-12-05 20:22:14,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:22:14,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:22:14,288 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-05 20:22:14,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:14,427 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:22:14,436 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-05 20:22:14,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:14,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:14,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:14,532 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:22:14,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14 WrapperNode [2022-12-05 20:22:14,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:14,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:14,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:22:14,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:22:14,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,594 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-05 20:22:14,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:14,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:22:14,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:22:14,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:22:14,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:22:14,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:22:14,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:22:14,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:22:14,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (1/1) ... [2022-12-05 20:22:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:14,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:22:14,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:22:14,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:22:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:22:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:22:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:22:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:22:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:22:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:22:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:22:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:22:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:22:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:22:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:22:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:22:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:22:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:22:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:22:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:22:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:22:14,705 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:22:14,875 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:22:14,876 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:22:15,124 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:22:15,236 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:22:15,236 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:22:15,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:15 BoogieIcfgContainer [2022-12-05 20:22:15,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:22:15,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:22:15,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:22:15,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:22:15,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:22:14" (1/3) ... [2022-12-05 20:22:15,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8f8f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:15, skipping insertion in model container [2022-12-05 20:22:15,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:14" (2/3) ... [2022-12-05 20:22:15,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8f8f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:15, skipping insertion in model container [2022-12-05 20:22:15,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:15" (3/3) ... [2022-12-05 20:22:15,243 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:22:15,256 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:22:15,256 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:22:15,256 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:22:15,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:22:15,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:22:15,350 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:22:15,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:15,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:22:15,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:22:15,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:15,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:22:15,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:15,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:15,393 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:22:15,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:22:15,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:22:15,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-05 20:22:20,452 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-05 20:22:20,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:22:20,473 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=false, 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;@70f84fbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:22:20,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:22:20,487 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 20:22:20,487 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:20,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:20,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:20,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -375403712, now seen corresponding path program 1 times [2022-12-05 20:22:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:20,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842671047] [2022-12-05 20:22:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842671047] [2022-12-05 20:22:20,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842671047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:20,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:20,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112953968] [2022-12-05 20:22:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:20,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:20,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:20,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:20,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:20,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:20,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:20,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:21,293 INFO L130 PetriNetUnfolder]: 3519/5103 cut-off events. [2022-12-05 20:22:21,294 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-05 20:22:21,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 5103 events. 3519/5103 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27245 event pairs, 954 based on Foata normal form. 0/4619 useless extension candidates. Maximal degree in co-relation 10071. Up to 3826 conditions per place. [2022-12-05 20:22:21,362 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2022-12-05 20:22:21,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2022-12-05 20:22:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-05 20:22:21,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2022-12-05 20:22:21,372 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 61 transitions. [2022-12-05 20:22:21,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2022-12-05 20:22:21,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:21,386 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-05 20:22:21,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-05 20:22:21,390 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-05 20:22:21,390 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2022-12-05 20:22:21,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:21,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:21,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:21,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:22:21,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash 879830714, now seen corresponding path program 1 times [2022-12-05 20:22:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:21,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939774730] [2022-12-05 20:22:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:21,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939774730] [2022-12-05 20:22:21,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939774730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:21,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:21,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491312062] [2022-12-05 20:22:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:21,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:21,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:21,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:21,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:21,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:21,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:21,892 INFO L130 PetriNetUnfolder]: 2551/3709 cut-off events. [2022-12-05 20:22:21,892 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-05 20:22:21,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7623 conditions, 3709 events. 2551/3709 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18645 event pairs, 1015 based on Foata normal form. 96/3786 useless extension candidates. Maximal degree in co-relation 7613. Up to 2209 conditions per place. [2022-12-05 20:22:21,908 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 31 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-05 20:22:21,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 154 flow [2022-12-05 20:22:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 20:22:21,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2022-12-05 20:22:21,910 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 3 states and 46 transitions. [2022-12-05 20:22:21,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 154 flow [2022-12-05 20:22:21,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:21,912 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 70 flow [2022-12-05 20:22:21,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-05 20:22:21,913 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2022-12-05 20:22:21,913 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-05 20:22:21,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:21,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:21,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:21,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:22:21,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -592355939, now seen corresponding path program 1 times [2022-12-05 20:22:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:21,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152213575] [2022-12-05 20:22:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:22,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:22,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152213575] [2022-12-05 20:22:22,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152213575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:22,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:22,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231362854] [2022-12-05 20:22:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:22,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:22,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:22,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:22,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:22,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:22,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:22,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:22,584 INFO L130 PetriNetUnfolder]: 2670/3873 cut-off events. [2022-12-05 20:22:22,584 INFO L131 PetriNetUnfolder]: For 180/195 co-relation queries the response was YES. [2022-12-05 20:22:22,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7931 conditions, 3873 events. 2670/3873 cut-off events. For 180/195 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19340 event pairs, 900 based on Foata normal form. 24/3863 useless extension candidates. Maximal degree in co-relation 7920. Up to 3460 conditions per place. [2022-12-05 20:22:22,599 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2022-12-05 20:22:22,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 204 flow [2022-12-05 20:22:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-05 20:22:22,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-05 20:22:22,600 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states and 62 transitions. [2022-12-05 20:22:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 204 flow [2022-12-05 20:22:22,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:22,601 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 105 flow [2022-12-05 20:22:22,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-05 20:22:22,602 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2022-12-05 20:22:22,602 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 105 flow [2022-12-05 20:22:22,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:22,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:22,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:22,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:22:22,603 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1185845516, now seen corresponding path program 1 times [2022-12-05 20:22:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:22,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038536956] [2022-12-05 20:22:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:22,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:23,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038536956] [2022-12-05 20:22:23,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038536956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:23,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:23,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899174607] [2022-12-05 20:22:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:23,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:23,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:23,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:23,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:23,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:23,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:23,440 INFO L130 PetriNetUnfolder]: 2702/3917 cut-off events. [2022-12-05 20:22:23,440 INFO L131 PetriNetUnfolder]: For 1455/1662 co-relation queries the response was YES. [2022-12-05 20:22:23,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9167 conditions, 3917 events. 2702/3917 cut-off events. For 1455/1662 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19542 event pairs, 840 based on Foata normal form. 54/3940 useless extension candidates. Maximal degree in co-relation 9154. Up to 3460 conditions per place. [2022-12-05 20:22:23,457 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 41 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-05 20:22:23,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 255 flow [2022-12-05 20:22:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-05 20:22:23,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-05 20:22:23,458 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 105 flow. Second operand 4 states and 64 transitions. [2022-12-05 20:22:23,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 255 flow [2022-12-05 20:22:23,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:22:23,460 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 148 flow [2022-12-05 20:22:23,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-05 20:22:23,461 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-05 20:22:23,461 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 148 flow [2022-12-05 20:22:23,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:23,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:23,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:22:23,462 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1183194086, now seen corresponding path program 2 times [2022-12-05 20:22:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:23,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712426085] [2022-12-05 20:22:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712426085] [2022-12-05 20:22:23,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712426085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:23,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:23,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:23,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859904338] [2022-12-05 20:22:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:23,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:23,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:23,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:23,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:23,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:23,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:23,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:24,041 INFO L130 PetriNetUnfolder]: 2680/3871 cut-off events. [2022-12-05 20:22:24,041 INFO L131 PetriNetUnfolder]: For 2481/2928 co-relation queries the response was YES. [2022-12-05 20:22:24,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10296 conditions, 3871 events. 2680/3871 cut-off events. For 2481/2928 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19220 event pairs, 994 based on Foata normal form. 96/3951 useless extension candidates. Maximal degree in co-relation 10280. Up to 3432 conditions per place. [2022-12-05 20:22:24,060 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 47 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2022-12-05 20:22:24,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 380 flow [2022-12-05 20:22:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-05 20:22:24,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2022-12-05 20:22:24,062 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 148 flow. Second operand 5 states and 76 transitions. [2022-12-05 20:22:24,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 380 flow [2022-12-05 20:22:24,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 353 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:24,066 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 247 flow [2022-12-05 20:22:24,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-05 20:22:24,066 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2022-12-05 20:22:24,066 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 247 flow [2022-12-05 20:22:24,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:24,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:24,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:24,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:22:24,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 175773621, now seen corresponding path program 1 times [2022-12-05 20:22:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:24,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726301120] [2022-12-05 20:22:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726301120] [2022-12-05 20:22:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726301120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:24,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:24,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339749088] [2022-12-05 20:22:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:24,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:24,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:24,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:24,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:24,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:24,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:24,759 INFO L130 PetriNetUnfolder]: 2749/3973 cut-off events. [2022-12-05 20:22:24,759 INFO L131 PetriNetUnfolder]: For 4869/5691 co-relation queries the response was YES. [2022-12-05 20:22:24,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11667 conditions, 3973 events. 2749/3973 cut-off events. For 4869/5691 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19522 event pairs, 470 based on Foata normal form. 153/4122 useless extension candidates. Maximal degree in co-relation 11648. Up to 2993 conditions per place. [2022-12-05 20:22:24,782 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 64 selfloop transitions, 17 changer transitions 0/85 dead transitions. [2022-12-05 20:22:24,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 537 flow [2022-12-05 20:22:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-05 20:22:24,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2022-12-05 20:22:24,785 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 247 flow. Second operand 5 states and 87 transitions. [2022-12-05 20:22:24,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 537 flow [2022-12-05 20:22:24,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 517 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:24,794 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 327 flow [2022-12-05 20:22:24,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-05 20:22:24,796 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-05 20:22:24,796 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 327 flow [2022-12-05 20:22:24,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:24,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:24,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:22:24,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:24,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1150914438, now seen corresponding path program 1 times [2022-12-05 20:22:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:24,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23413723] [2022-12-05 20:22:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:25,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23413723] [2022-12-05 20:22:25,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23413723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:25,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497539208] [2022-12-05 20:22:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:25,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:25,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:25,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:25,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:25,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:25,575 INFO L130 PetriNetUnfolder]: 2789/4031 cut-off events. [2022-12-05 20:22:25,575 INFO L131 PetriNetUnfolder]: For 8934/10224 co-relation queries the response was YES. [2022-12-05 20:22:25,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13394 conditions, 4031 events. 2789/4031 cut-off events. For 8934/10224 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19853 event pairs, 643 based on Foata normal form. 195/4222 useless extension candidates. Maximal degree in co-relation 13372. Up to 3017 conditions per place. [2022-12-05 20:22:25,596 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 59 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2022-12-05 20:22:25,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 571 flow [2022-12-05 20:22:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 20:22:25,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-05 20:22:25,598 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 327 flow. Second operand 4 states and 68 transitions. [2022-12-05 20:22:25,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 571 flow [2022-12-05 20:22:25,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 549 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:25,631 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 391 flow [2022-12-05 20:22:25,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-05 20:22:25,632 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2022-12-05 20:22:25,632 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 391 flow [2022-12-05 20:22:25,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:25,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:25,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:25,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:22:25,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:25,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1154072284, now seen corresponding path program 1 times [2022-12-05 20:22:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535359221] [2022-12-05 20:22:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:25,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:25,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535359221] [2022-12-05 20:22:25,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535359221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:25,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:25,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:25,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7611379] [2022-12-05 20:22:25,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:25,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:25,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:25,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:25,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:25,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:25,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:25,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:26,413 INFO L130 PetriNetUnfolder]: 2945/4259 cut-off events. [2022-12-05 20:22:26,414 INFO L131 PetriNetUnfolder]: For 12948/14748 co-relation queries the response was YES. [2022-12-05 20:22:26,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15203 conditions, 4259 events. 2945/4259 cut-off events. For 12948/14748 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21358 event pairs, 505 based on Foata normal form. 285/4540 useless extension candidates. Maximal degree in co-relation 15178. Up to 3095 conditions per place. [2022-12-05 20:22:26,443 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 79 selfloop transitions, 29 changer transitions 0/112 dead transitions. [2022-12-05 20:22:26,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 829 flow [2022-12-05 20:22:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:22:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:22:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-05 20:22:26,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 20:22:26,446 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 391 flow. Second operand 8 states and 121 transitions. [2022-12-05 20:22:26,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 829 flow [2022-12-05 20:22:26,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 799 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:26,462 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 556 flow [2022-12-05 20:22:26,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=556, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2022-12-05 20:22:26,464 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2022-12-05 20:22:26,464 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 556 flow [2022-12-05 20:22:26,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:26,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:26,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:26,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:22:26,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash -751331246, now seen corresponding path program 2 times [2022-12-05 20:22:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:26,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001386929] [2022-12-05 20:22:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:26,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001386929] [2022-12-05 20:22:26,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001386929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:26,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:26,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958449725] [2022-12-05 20:22:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:26,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:26,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:26,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 556 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:26,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:26,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:26,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:27,257 INFO L130 PetriNetUnfolder]: 3299/4832 cut-off events. [2022-12-05 20:22:27,257 INFO L131 PetriNetUnfolder]: For 20619/22902 co-relation queries the response was YES. [2022-12-05 20:22:27,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18557 conditions, 4832 events. 3299/4832 cut-off events. For 20619/22902 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 25380 event pairs, 396 based on Foata normal form. 273/5101 useless extension candidates. Maximal degree in co-relation 18529. Up to 2806 conditions per place. [2022-12-05 20:22:27,286 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 72 selfloop transitions, 36 changer transitions 0/112 dead transitions. [2022-12-05 20:22:27,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 112 transitions, 952 flow [2022-12-05 20:22:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:22:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:22:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-05 20:22:27,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2022-12-05 20:22:27,288 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 556 flow. Second operand 6 states and 101 transitions. [2022-12-05 20:22:27,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 112 transitions, 952 flow [2022-12-05 20:22:27,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 112 transitions, 894 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:27,316 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 638 flow [2022-12-05 20:22:27,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2022-12-05 20:22:27,317 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-12-05 20:22:27,317 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 638 flow [2022-12-05 20:22:27,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:27,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:27,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:27,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:22:27,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1435155245, now seen corresponding path program 1 times [2022-12-05 20:22:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:27,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261025186] [2022-12-05 20:22:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:27,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:27,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261025186] [2022-12-05 20:22:27,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261025186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:27,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:27,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848077733] [2022-12-05 20:22:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:27,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:27,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:27,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-05 20:22:27,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:27,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:27,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-05 20:22:27,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:28,195 INFO L130 PetriNetUnfolder]: 6812/9677 cut-off events. [2022-12-05 20:22:28,195 INFO L131 PetriNetUnfolder]: For 48963/49365 co-relation queries the response was YES. [2022-12-05 20:22:28,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37820 conditions, 9677 events. 6812/9677 cut-off events. For 48963/49365 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 54230 event pairs, 2777 based on Foata normal form. 360/10003 useless extension candidates. Maximal degree in co-relation 37789. Up to 5275 conditions per place. [2022-12-05 20:22:28,351 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 86 selfloop transitions, 2 changer transitions 6/103 dead transitions. [2022-12-05 20:22:28,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 1064 flow [2022-12-05 20:22:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 20:22:28,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2022-12-05 20:22:28,353 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 638 flow. Second operand 3 states and 49 transitions. [2022-12-05 20:22:28,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 1064 flow [2022-12-05 20:22:28,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 980 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-05 20:22:28,430 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 570 flow [2022-12-05 20:22:28,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2022-12-05 20:22:28,432 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-12-05 20:22:28,432 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 570 flow [2022-12-05 20:22:28,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:28,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:28,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:28,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:22:28,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 226686531, now seen corresponding path program 2 times [2022-12-05 20:22:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:28,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123446641] [2022-12-05 20:22:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123446641] [2022-12-05 20:22:28,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123446641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:28,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:28,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490893012] [2022-12-05 20:22:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:28,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:28,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:28,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:28,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:28,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:28,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:29,171 INFO L130 PetriNetUnfolder]: 3960/5980 cut-off events. [2022-12-05 20:22:29,172 INFO L131 PetriNetUnfolder]: For 36675/36988 co-relation queries the response was YES. [2022-12-05 20:22:29,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23920 conditions, 5980 events. 3960/5980 cut-off events. For 36675/36988 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 35857 event pairs, 675 based on Foata normal form. 648/6595 useless extension candidates. Maximal degree in co-relation 23889. Up to 3904 conditions per place. [2022-12-05 20:22:29,202 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 106 selfloop transitions, 9 changer transitions 34/160 dead transitions. [2022-12-05 20:22:29,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 160 transitions, 1596 flow [2022-12-05 20:22:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-05 20:22:29,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2022-12-05 20:22:29,204 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 570 flow. Second operand 5 states and 89 transitions. [2022-12-05 20:22:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 160 transitions, 1596 flow [2022-12-05 20:22:29,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 160 transitions, 1551 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-05 20:22:29,225 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 639 flow [2022-12-05 20:22:29,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=639, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2022-12-05 20:22:29,226 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2022-12-05 20:22:29,226 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 639 flow [2022-12-05 20:22:29,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:29,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:29,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:22:29,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1729472621, now seen corresponding path program 1 times [2022-12-05 20:22:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871789476] [2022-12-05 20:22:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:29,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:29,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871789476] [2022-12-05 20:22:29,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871789476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:29,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:29,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802159050] [2022-12-05 20:22:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:29,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:29,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:29,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:29,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 639 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:29,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:29,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:29,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:29,917 INFO L130 PetriNetUnfolder]: 3079/4811 cut-off events. [2022-12-05 20:22:29,917 INFO L131 PetriNetUnfolder]: For 31455/31748 co-relation queries the response was YES. [2022-12-05 20:22:29,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21583 conditions, 4811 events. 3079/4811 cut-off events. For 31455/31748 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 29256 event pairs, 271 based on Foata normal form. 504/5290 useless extension candidates. Maximal degree in co-relation 21550. Up to 1722 conditions per place. [2022-12-05 20:22:29,942 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 120 selfloop transitions, 17 changer transitions 43/188 dead transitions. [2022-12-05 20:22:29,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 188 transitions, 1894 flow [2022-12-05 20:22:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-05 20:22:29,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2022-12-05 20:22:29,944 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 639 flow. Second operand 7 states and 125 transitions. [2022-12-05 20:22:29,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 188 transitions, 1894 flow [2022-12-05 20:22:29,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 188 transitions, 1791 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-12-05 20:22:29,971 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 578 flow [2022-12-05 20:22:29,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2022-12-05 20:22:29,971 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-05 20:22:29,971 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 578 flow [2022-12-05 20:22:29,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:29,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:29,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:22:29,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 243622677, now seen corresponding path program 1 times [2022-12-05 20:22:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:29,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633072616] [2022-12-05 20:22:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:30,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:30,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633072616] [2022-12-05 20:22:30,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633072616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:30,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:30,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:22:30,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688372405] [2022-12-05 20:22:30,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:30,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:30,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:30,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:30,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:30,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:30,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:30,593 INFO L130 PetriNetUnfolder]: 2655/4191 cut-off events. [2022-12-05 20:22:30,593 INFO L131 PetriNetUnfolder]: For 23512/23703 co-relation queries the response was YES. [2022-12-05 20:22:30,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 4191 events. 2655/4191 cut-off events. For 23512/23703 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 25481 event pairs, 202 based on Foata normal form. 223/4389 useless extension candidates. Maximal degree in co-relation 19680. Up to 1506 conditions per place. [2022-12-05 20:22:30,615 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 124 selfloop transitions, 25 changer transitions 51/208 dead transitions. [2022-12-05 20:22:30,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 208 transitions, 2064 flow [2022-12-05 20:22:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:22:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:22:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2022-12-05 20:22:30,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-05 20:22:30,617 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 578 flow. Second operand 9 states and 159 transitions. [2022-12-05 20:22:30,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 208 transitions, 2064 flow [2022-12-05 20:22:30,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 208 transitions, 1932 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-05 20:22:30,746 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 606 flow [2022-12-05 20:22:30,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2022-12-05 20:22:30,747 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2022-12-05 20:22:30,747 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 606 flow [2022-12-05 20:22:30,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:30,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:30,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:30,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:22:30,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2015520232, now seen corresponding path program 1 times [2022-12-05 20:22:30,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:30,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733038647] [2022-12-05 20:22:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:31,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733038647] [2022-12-05 20:22:31,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733038647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:31,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:31,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253707918] [2022-12-05 20:22:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:31,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:31,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 20:22:31,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 606 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:31,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:31,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 20:22:31,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:32,858 INFO L130 PetriNetUnfolder]: 10974/16136 cut-off events. [2022-12-05 20:22:32,858 INFO L131 PetriNetUnfolder]: For 68155/68155 co-relation queries the response was YES. [2022-12-05 20:22:32,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70555 conditions, 16136 events. 10974/16136 cut-off events. For 68155/68155 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 97893 event pairs, 1217 based on Foata normal form. 12/16148 useless extension candidates. Maximal degree in co-relation 70521. Up to 8391 conditions per place. [2022-12-05 20:22:32,927 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 124 selfloop transitions, 28 changer transitions 118/270 dead transitions. [2022-12-05 20:22:32,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 270 transitions, 2787 flow [2022-12-05 20:22:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:22:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:22:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-05 20:22:32,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-05 20:22:32,929 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 606 flow. Second operand 6 states and 102 transitions. [2022-12-05 20:22:32,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 270 transitions, 2787 flow [2022-12-05 20:22:33,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 270 transitions, 2473 flow, removed 106 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:33,718 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 780 flow [2022-12-05 20:22:33,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2022-12-05 20:22:33,719 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2022-12-05 20:22:33,719 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 780 flow [2022-12-05 20:22:33,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:33,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:33,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:33,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:22:33,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash 821126972, now seen corresponding path program 2 times [2022-12-05 20:22:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:33,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269856501] [2022-12-05 20:22:33,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:33,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269856501] [2022-12-05 20:22:33,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269856501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:33,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:33,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:22:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315704369] [2022-12-05 20:22:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:33,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:22:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:33,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:22:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:22:33,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:33,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 780 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:33,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:33,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:34,402 INFO L130 PetriNetUnfolder]: 2764/4424 cut-off events. [2022-12-05 20:22:34,403 INFO L131 PetriNetUnfolder]: For 31748/31973 co-relation queries the response was YES. [2022-12-05 20:22:34,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22392 conditions, 4424 events. 2764/4424 cut-off events. For 31748/31973 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 26841 event pairs, 294 based on Foata normal form. 195/4518 useless extension candidates. Maximal degree in co-relation 22353. Up to 1774 conditions per place. [2022-12-05 20:22:34,421 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 74 selfloop transitions, 18 changer transitions 85/184 dead transitions. [2022-12-05 20:22:34,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 184 transitions, 2087 flow [2022-12-05 20:22:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:22:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:22:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-05 20:22:34,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 20:22:34,423 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 780 flow. Second operand 8 states and 121 transitions. [2022-12-05 20:22:34,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 184 transitions, 2087 flow [2022-12-05 20:22:34,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 184 transitions, 1968 flow, removed 46 selfloop flow, removed 8 redundant places. [2022-12-05 20:22:34,510 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 524 flow [2022-12-05 20:22:34,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=524, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2022-12-05 20:22:34,511 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2022-12-05 20:22:34,511 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 524 flow [2022-12-05 20:22:34,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:34,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:34,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:34,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:22:34,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:34,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash -812850997, now seen corresponding path program 1 times [2022-12-05 20:22:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:34,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075728971] [2022-12-05 20:22:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075728971] [2022-12-05 20:22:35,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075728971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:35,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:35,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579555182] [2022-12-05 20:22:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:35,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 20:22:35,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 60 transitions, 524 flow. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:35,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:35,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 20:22:35,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:35,522 INFO L130 PetriNetUnfolder]: 1507/2387 cut-off events. [2022-12-05 20:22:35,523 INFO L131 PetriNetUnfolder]: For 11070/11070 co-relation queries the response was YES. [2022-12-05 20:22:35,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11531 conditions, 2387 events. 1507/2387 cut-off events. For 11070/11070 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11437 event pairs, 236 based on Foata normal form. 1/2388 useless extension candidates. Maximal degree in co-relation 11502. Up to 1308 conditions per place. [2022-12-05 20:22:35,531 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 56 selfloop transitions, 6 changer transitions 73/135 dead transitions. [2022-12-05 20:22:35,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 135 transitions, 1395 flow [2022-12-05 20:22:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:22:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:22:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-05 20:22:35,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-05 20:22:35,532 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 524 flow. Second operand 6 states and 77 transitions. [2022-12-05 20:22:35,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 135 transitions, 1395 flow [2022-12-05 20:22:35,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 135 transitions, 1203 flow, removed 47 selfloop flow, removed 12 redundant places. [2022-12-05 20:22:35,552 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 330 flow [2022-12-05 20:22:35,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2022-12-05 20:22:35,553 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-12-05 20:22:35,553 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 330 flow [2022-12-05 20:22:35,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:35,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:35,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:22:35,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -232002009, now seen corresponding path program 2 times [2022-12-05 20:22:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:35,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418543826] [2022-12-05 20:22:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:35,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:22:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:35,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:22:35,624 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:22:35,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:22:35,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:22:35,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:22:35,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:22:35,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:22:35,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:22:35,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:22:35,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 20:22:35,627 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:35,630 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:22:35,630 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:22:35,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:22:35 BasicIcfg [2022-12-05 20:22:35,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:22:35,682 INFO L158 Benchmark]: Toolchain (without parser) took 21571.53ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 180.7MB in the beginning and 760.9MB in the end (delta: -580.2MB). Peak memory consumption was 431.2MB. Max. memory is 8.0GB. [2022-12-05 20:22:35,682 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:22:35,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.88ms. Allocated memory is still 206.6MB. Free memory was 180.2MB in the beginning and 153.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:22:35,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.61ms. Allocated memory is still 206.6MB. Free memory was 153.0MB in the beginning and 149.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:35,682 INFO L158 Benchmark]: Boogie Preprocessor took 42.83ms. Allocated memory is still 206.6MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:35,683 INFO L158 Benchmark]: RCFGBuilder took 599.50ms. Allocated memory is still 206.6MB. Free memory was 147.7MB in the beginning and 111.5MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-05 20:22:35,683 INFO L158 Benchmark]: TraceAbstraction took 20442.04ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 111.0MB in the beginning and 760.9MB in the end (delta: -649.9MB). Peak memory consumption was 362.0MB. Max. memory is 8.0GB. [2022-12-05 20:22:35,684 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.12ms. Allocated memory is still 206.6MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.88ms. Allocated memory is still 206.6MB. Free memory was 180.2MB in the beginning and 153.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.61ms. Allocated memory is still 206.6MB. Free memory was 153.0MB in the beginning and 149.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.83ms. Allocated memory is still 206.6MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 599.50ms. Allocated memory is still 206.6MB. Free memory was 147.7MB in the beginning and 111.5MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 20442.04ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 111.0MB in the beginning and 760.9MB in the end (delta: -649.9MB). Peak memory consumption was 362.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 136 PlacesBefore, 45 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 2052, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2124, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1868, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1868, independent: 1796, independent conditional: 0, independent unconditional: 1796, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2124, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1868, unknown conditional: 0, unknown unconditional: 1868] , Statistics on independence cache: Total cache size (in pairs): 2632, Positive cache size: 2589, Positive conditional cache size: 0, Positive unconditional cache size: 2589, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-1, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=0, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=1, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t776; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=2, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1598 IncrementalHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 31 mSDtfsCounter, 1598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=14, InterpolantAutomatonStates: 86, 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, 4.1s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 2343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:22:35,718 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...