/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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:26:54,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:26:54,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:26:54,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:26:54,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:26:54,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:26:54,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:26:54,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:26:54,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:26:54,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:26:54,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:26:54,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:26:54,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:26:54,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:26:54,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:26:54,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:26:54,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:26:54,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:26:54,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:26:54,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:26:54,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:26:54,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:26:54,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:26:54,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:26:54,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:26:54,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:26:54,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:26:54,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:26:54,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:26:54,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:26:54,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:26:54,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:26:54,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:26:54,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:26:54,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:26:54,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:26:54,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:26:54,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:26:54,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:26:54,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:26:54,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:26:54,506 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:26:54,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:26:54,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:26:54,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:26:54,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:26:54,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:26:54,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:26:54,530 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:26:54,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:26:54,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:26:54,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:26:54,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:26:54,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:26:54,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:26:54,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:26:54,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:26:54,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:26:54,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:26:54,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:26:54,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:26:54,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:26:54,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:26:54,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:26:54,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:26:54,533 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:26:54,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:26:54,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:26:54,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:26:54,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:26:54,790 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:26:54,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:26:55,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:26:56,037 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:26:56,037 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:26:56,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8a16573/18e7a2b364354bdd972411e84f761770/FLAGca8e86987 [2022-12-05 20:26:56,057 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b8a16573/18e7a2b364354bdd972411e84f761770 [2022-12-05 20:26:56,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:26:56,060 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:26:56,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:26:56,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:26:56,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:26:56,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3a07df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56, skipping insertion in model container [2022-12-05 20:26:56,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:26:56,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:26:56,212 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-05 20:26:56,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:26:56,411 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:26:56,420 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-05 20:26:56,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:26:56,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:26:56,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:26:56,504 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:26:56,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56 WrapperNode [2022-12-05 20:26:56,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:26:56,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:26:56,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:26:56,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:26:56,511 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:26:56" (1/1) ... [2022-12-05 20:26:56,524 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:26:56" (1/1) ... [2022-12-05 20:26:56,541 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-05 20:26:56,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:26:56,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:26:56,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:26:56,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:26:56,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,568 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:26:56,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:26:56,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:26:56,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:26:56,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (1/1) ... [2022-12-05 20:26:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:26:56,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:26:56,596 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:26:56,601 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:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:26:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:26:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:26:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:26:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:26:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:26:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:26:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:26:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:26:56,633 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:26:56,742 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:26:56,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:26:56,961 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:26:57,118 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:26:57,118 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:26:57,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:26:57 BoogieIcfgContainer [2022-12-05 20:26:57,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:26:57,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:26:57,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:26:57,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:26:57,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:26:56" (1/3) ... [2022-12-05 20:26:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4600180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:26:57, skipping insertion in model container [2022-12-05 20:26:57,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:26:56" (2/3) ... [2022-12-05 20:26:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4600180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:26:57, skipping insertion in model container [2022-12-05 20:26:57,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:26:57" (3/3) ... [2022-12-05 20:26:57,127 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:26:57,139 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:26:57,139 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:26:57,139 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:26:57,192 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:26:57,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-05 20:26:57,274 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-05 20:26:57,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:57,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:26:57,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-05 20:26:57,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-05 20:26:57,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:26:57,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-05 20:26:57,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2022-12-05 20:26:57,318 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-05 20:26:57,318 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:26:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:26:57,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-05 20:26:57,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-05 20:27:01,213 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-05 20:27:01,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:27:01,248 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;@652552d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:27:01,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:27:01,251 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-05 20:27:01,251 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:01,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:01,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:27:01,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 464649, now seen corresponding path program 1 times [2022-12-05 20:27:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:01,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543040595] [2022-12-05 20:27:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:01,612 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:27:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:01,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543040595] [2022-12-05 20:27:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543040595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:01,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:01,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:01,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978144397] [2022-12-05 20:27:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:01,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:01,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:01,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:01,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:01,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 20:27:01,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:27:01,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:01,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 20:27:01,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:01,885 INFO L130 PetriNetUnfolder]: 882/1394 cut-off events. [2022-12-05 20:27:01,885 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 20:27:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 1394 events. 882/1394 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6629 event pairs, 234 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 2757. Up to 1078 conditions per place. [2022-12-05 20:27:01,893 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 29 selfloop transitions, 2 changer transitions 8/41 dead transitions. [2022-12-05 20:27:01,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2022-12-05 20:27:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-05 20:27:01,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-05 20:27:01,902 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 50 transitions. [2022-12-05 20:27:01,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2022-12-05 20:27:01,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:01,906 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 50 flow [2022-12-05 20:27:01,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-05 20:27:01,909 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 20:27:01,909 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 50 flow [2022-12-05 20:27:01,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:27:01,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:01,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:01,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:27:01,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1017722405, now seen corresponding path program 1 times [2022-12-05 20:27:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:01,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478717210] [2022-12-05 20:27:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:02,631 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:27:02,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:02,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478717210] [2022-12-05 20:27:02,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478717210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:02,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:02,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766510542] [2022-12-05 20:27:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:02,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:02,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:02,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:02,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 20:27:02,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 50 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:27:02,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:02,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 20:27:02,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:02,814 INFO L130 PetriNetUnfolder]: 1042/1562 cut-off events. [2022-12-05 20:27:02,814 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 20:27:02,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1562 events. 1042/1562 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6881 event pairs, 166 based on Foata normal form. 30/1592 useless extension candidates. Maximal degree in co-relation 3261. Up to 1323 conditions per place. [2022-12-05 20:27:02,821 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-05 20:27:02,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 208 flow [2022-12-05 20:27:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 20:27:02,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2022-12-05 20:27:02,822 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 50 flow. Second operand 4 states and 49 transitions. [2022-12-05 20:27:02,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 208 flow [2022-12-05 20:27:02,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:02,823 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 109 flow [2022-12-05 20:27:02,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-05 20:27:02,824 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-05 20:27:02,824 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 109 flow [2022-12-05 20:27:02,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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:27:02,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:02,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:27:02,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1484622426, now seen corresponding path program 1 times [2022-12-05 20:27:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:02,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059983802] [2022-12-05 20:27:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:02,922 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:27:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059983802] [2022-12-05 20:27:02,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059983802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:02,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:02,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880263420] [2022-12-05 20:27:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:02,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:02,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:02,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 20:27:02,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:27:02,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:02,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 20:27:02,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:03,058 INFO L130 PetriNetUnfolder]: 722/1162 cut-off events. [2022-12-05 20:27:03,059 INFO L131 PetriNetUnfolder]: For 468/493 co-relation queries the response was YES. [2022-12-05 20:27:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 1162 events. 722/1162 cut-off events. For 468/493 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5293 event pairs, 143 based on Foata normal form. 42/1200 useless extension candidates. Maximal degree in co-relation 3171. Up to 809 conditions per place. [2022-12-05 20:27:03,064 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 35 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-05 20:27:03,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 234 flow [2022-12-05 20:27:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 20:27:03,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-05 20:27:03,067 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 109 flow. Second operand 3 states and 33 transitions. [2022-12-05 20:27:03,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 234 flow [2022-12-05 20:27:03,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:27:03,069 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 120 flow [2022-12-05 20:27:03,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-05 20:27:03,070 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-05 20:27:03,071 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 120 flow [2022-12-05 20:27:03,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:27:03,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:03,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:03,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:27:03,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1616292775, now seen corresponding path program 1 times [2022-12-05 20:27:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:03,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427905268] [2022-12-05 20:27:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:03,463 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:27:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:03,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427905268] [2022-12-05 20:27:03,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427905268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:03,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:03,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904295433] [2022-12-05 20:27:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:03,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:03,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:03,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:03,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:03,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:03,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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:27:03,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:03,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:03,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:03,667 INFO L130 PetriNetUnfolder]: 882/1369 cut-off events. [2022-12-05 20:27:03,667 INFO L131 PetriNetUnfolder]: For 844/844 co-relation queries the response was YES. [2022-12-05 20:27:03,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 1369 events. 882/1369 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6043 event pairs, 180 based on Foata normal form. 12/1381 useless extension candidates. Maximal degree in co-relation 3993. Up to 1137 conditions per place. [2022-12-05 20:27:03,674 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-05 20:27:03,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 242 flow [2022-12-05 20:27:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 20:27:03,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-05 20:27:03,676 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 120 flow. Second operand 3 states and 36 transitions. [2022-12-05 20:27:03,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 242 flow [2022-12-05 20:27:03,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:03,680 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 122 flow [2022-12-05 20:27:03,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-05 20:27:03,682 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-05 20:27:03,682 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 122 flow [2022-12-05 20:27:03,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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:27:03,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:03,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:03,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:27:03,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1262520475, now seen corresponding path program 1 times [2022-12-05 20:27:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:03,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398886015] [2022-12-05 20:27:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:04,330 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:27:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:04,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398886015] [2022-12-05 20:27:04,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398886015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:04,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:04,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328322544] [2022-12-05 20:27:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:04,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:04,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 20:27:04,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 122 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:27:04,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:04,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 20:27:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:04,553 INFO L130 PetriNetUnfolder]: 1226/1884 cut-off events. [2022-12-05 20:27:04,553 INFO L131 PetriNetUnfolder]: For 1086/1086 co-relation queries the response was YES. [2022-12-05 20:27:04,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 1884 events. 1226/1884 cut-off events. For 1086/1086 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8713 event pairs, 317 based on Foata normal form. 48/1932 useless extension candidates. Maximal degree in co-relation 5437. Up to 988 conditions per place. [2022-12-05 20:27:04,561 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2022-12-05 20:27:04,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 300 flow [2022-12-05 20:27:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 20:27:04,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:27:04,564 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 122 flow. Second operand 4 states and 45 transitions. [2022-12-05 20:27:04,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 300 flow [2022-12-05 20:27:04,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:04,566 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 172 flow [2022-12-05 20:27:04,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-05 20:27:04,568 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-05 20:27:04,570 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 172 flow [2022-12-05 20:27:04,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:27:04,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:04,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:04,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:27:04,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash 985962938, now seen corresponding path program 1 times [2022-12-05 20:27:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:04,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723559802] [2022-12-05 20:27:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:04,955 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:27:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:04,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723559802] [2022-12-05 20:27:04,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723559802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:04,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:04,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186856377] [2022-12-05 20:27:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:04,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:27:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:27:04,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:27:04,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:04,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:27:04,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:04,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:04,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:05,214 INFO L130 PetriNetUnfolder]: 1279/1973 cut-off events. [2022-12-05 20:27:05,215 INFO L131 PetriNetUnfolder]: For 2098/2138 co-relation queries the response was YES. [2022-12-05 20:27:05,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6306 conditions, 1973 events. 1279/1973 cut-off events. For 2098/2138 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9203 event pairs, 351 based on Foata normal form. 48/2021 useless extension candidates. Maximal degree in co-relation 6288. Up to 1604 conditions per place. [2022-12-05 20:27:05,223 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 57 selfloop transitions, 14 changer transitions 3/76 dead transitions. [2022-12-05 20:27:05,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 518 flow [2022-12-05 20:27:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 20:27:05,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2022-12-05 20:27:05,227 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 172 flow. Second operand 5 states and 58 transitions. [2022-12-05 20:27:05,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 518 flow [2022-12-05 20:27:05,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 501 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:05,231 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 274 flow [2022-12-05 20:27:05,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2022-12-05 20:27:05,233 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-05 20:27:05,233 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 274 flow [2022-12-05 20:27:05,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:27:05,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:05,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:05,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:27:05,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 500077213, now seen corresponding path program 1 times [2022-12-05 20:27:05,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191471924] [2022-12-05 20:27:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:05,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:05,777 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:27:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:05,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191471924] [2022-12-05 20:27:05,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191471924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:05,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:05,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292039361] [2022-12-05 20:27:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:05,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:05,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:05,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:05,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:05,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:05,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:06,064 INFO L130 PetriNetUnfolder]: 1285/1987 cut-off events. [2022-12-05 20:27:06,064 INFO L131 PetriNetUnfolder]: For 3460/3497 co-relation queries the response was YES. [2022-12-05 20:27:06,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 1987 events. 1285/1987 cut-off events. For 3460/3497 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9294 event pairs, 326 based on Foata normal form. 45/2032 useless extension candidates. Maximal degree in co-relation 7469. Up to 1460 conditions per place. [2022-12-05 20:27:06,076 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 59 selfloop transitions, 17 changer transitions 3/81 dead transitions. [2022-12-05 20:27:06,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 615 flow [2022-12-05 20:27:06,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 20:27:06,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2022-12-05 20:27:06,077 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 274 flow. Second operand 5 states and 58 transitions. [2022-12-05 20:27:06,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 615 flow [2022-12-05 20:27:06,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:27:06,082 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 373 flow [2022-12-05 20:27:06,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-05 20:27:06,083 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-05 20:27:06,083 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 373 flow [2022-12-05 20:27:06,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:06,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:06,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:06,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:27:06,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 841025935, now seen corresponding path program 1 times [2022-12-05 20:27:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:06,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138124717] [2022-12-05 20:27:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:06,334 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:27:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:06,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138124717] [2022-12-05 20:27:06,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138124717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:06,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:06,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564253308] [2022-12-05 20:27:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:06,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:06,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:06,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:06,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:06,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:06,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:06,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:06,606 INFO L130 PetriNetUnfolder]: 1295/2018 cut-off events. [2022-12-05 20:27:06,607 INFO L131 PetriNetUnfolder]: For 5367/5404 co-relation queries the response was YES. [2022-12-05 20:27:06,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 2018 events. 1295/2018 cut-off events. For 5367/5404 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9531 event pairs, 561 based on Foata normal form. 41/2059 useless extension candidates. Maximal degree in co-relation 8624. Up to 1737 conditions per place. [2022-12-05 20:27:06,619 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 61 selfloop transitions, 18 changer transitions 1/82 dead transitions. [2022-12-05 20:27:06,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 732 flow [2022-12-05 20:27:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-05 20:27:06,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3851851851851852 [2022-12-05 20:27:06,621 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 373 flow. Second operand 5 states and 52 transitions. [2022-12-05 20:27:06,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 732 flow [2022-12-05 20:27:06,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:06,626 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 531 flow [2022-12-05 20:27:06,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-05 20:27:06,627 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-05 20:27:06,627 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 531 flow [2022-12-05 20:27:06,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:06,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:06,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:06,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:27:06,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 844593415, now seen corresponding path program 2 times [2022-12-05 20:27:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:06,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086659956] [2022-12-05 20:27:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:07,091 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:27:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:07,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086659956] [2022-12-05 20:27:07,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086659956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:07,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:07,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177499665] [2022-12-05 20:27:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:07,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:07,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:07,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:07,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:07,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:07,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:07,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:07,448 INFO L130 PetriNetUnfolder]: 1300/2028 cut-off events. [2022-12-05 20:27:07,448 INFO L131 PetriNetUnfolder]: For 7909/7948 co-relation queries the response was YES. [2022-12-05 20:27:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9747 conditions, 2028 events. 1300/2028 cut-off events. For 7909/7948 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9713 event pairs, 329 based on Foata normal form. 43/2071 useless extension candidates. Maximal degree in co-relation 9719. Up to 1612 conditions per place. [2022-12-05 20:27:07,467 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 71 selfloop transitions, 32 changer transitions 7/112 dead transitions. [2022-12-05 20:27:07,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 1114 flow [2022-12-05 20:27:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:27:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:27:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-05 20:27:07,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2022-12-05 20:27:07,469 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 531 flow. Second operand 6 states and 68 transitions. [2022-12-05 20:27:07,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 1114 flow [2022-12-05 20:27:07,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 112 transitions, 1072 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:07,480 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 706 flow [2022-12-05 20:27:07,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2022-12-05 20:27:07,481 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-05 20:27:07,481 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 706 flow [2022-12-05 20:27:07,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:07,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:07,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:07,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:27:07,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 844399045, now seen corresponding path program 3 times [2022-12-05 20:27:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:07,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130778200] [2022-12-05 20:27:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:07,822 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:27:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130778200] [2022-12-05 20:27:07,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130778200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:07,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:07,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680812397] [2022-12-05 20:27:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:07,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:07,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:07,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:07,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:07,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:08,180 INFO L130 PetriNetUnfolder]: 1353/2145 cut-off events. [2022-12-05 20:27:08,181 INFO L131 PetriNetUnfolder]: For 11784/11820 co-relation queries the response was YES. [2022-12-05 20:27:08,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10988 conditions, 2145 events. 1353/2145 cut-off events. For 11784/11820 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10671 event pairs, 378 based on Foata normal form. 48/2193 useless extension candidates. Maximal degree in co-relation 10957. Up to 1498 conditions per place. [2022-12-05 20:27:08,228 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 62 selfloop transitions, 38 changer transitions 4/106 dead transitions. [2022-12-05 20:27:08,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 1151 flow [2022-12-05 20:27:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 20:27:08,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2022-12-05 20:27:08,232 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 706 flow. Second operand 5 states and 59 transitions. [2022-12-05 20:27:08,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 1151 flow [2022-12-05 20:27:08,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 1106 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:08,245 INFO L231 Difference]: Finished difference. Result has 63 places, 76 transitions, 862 flow [2022-12-05 20:27:08,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=862, PETRI_PLACES=63, PETRI_TRANSITIONS=76} [2022-12-05 20:27:08,246 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-05 20:27:08,246 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 862 flow [2022-12-05 20:27:08,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:08,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:08,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:08,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:27:08,247 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1801420029, now seen corresponding path program 1 times [2022-12-05 20:27:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:08,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008571752] [2022-12-05 20:27:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:08,343 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:27:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:08,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008571752] [2022-12-05 20:27:08,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008571752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:08,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:08,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868255304] [2022-12-05 20:27:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:08,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:08,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:08,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:08,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:08,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 76 transitions, 862 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:27:08,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:08,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:08,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:08,704 INFO L130 PetriNetUnfolder]: 2067/3312 cut-off events. [2022-12-05 20:27:08,704 INFO L131 PetriNetUnfolder]: For 24122/24312 co-relation queries the response was YES. [2022-12-05 20:27:08,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17693 conditions, 3312 events. 2067/3312 cut-off events. For 24122/24312 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 18973 event pairs, 379 based on Foata normal form. 113/3391 useless extension candidates. Maximal degree in co-relation 17661. Up to 1714 conditions per place. [2022-12-05 20:27:08,723 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 71 selfloop transitions, 6 changer transitions 68/150 dead transitions. [2022-12-05 20:27:08,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 150 transitions, 2028 flow [2022-12-05 20:27:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:27:08,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2022-12-05 20:27:08,724 INFO L175 Difference]: Start difference. First operand has 63 places, 76 transitions, 862 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:27:08,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 150 transitions, 2028 flow [2022-12-05 20:27:08,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 150 transitions, 1942 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:08,746 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 674 flow [2022-12-05 20:27:08,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=674, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2022-12-05 20:27:08,747 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2022-12-05 20:27:08,747 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 674 flow [2022-12-05 20:27:08,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:27:08,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:08,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:08,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:27:08,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash 198455273, now seen corresponding path program 2 times [2022-12-05 20:27:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751663220] [2022-12-05 20:27:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:08,841 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:27:08,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751663220] [2022-12-05 20:27:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751663220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:08,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213858755] [2022-12-05 20:27:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:08,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:08,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 20:27:08,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:08,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:08,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 20:27:08,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:08,978 INFO L130 PetriNetUnfolder]: 585/1052 cut-off events. [2022-12-05 20:27:08,978 INFO L131 PetriNetUnfolder]: For 7860/7952 co-relation queries the response was YES. [2022-12-05 20:27:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 1052 events. 585/1052 cut-off events. For 7860/7952 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5373 event pairs, 136 based on Foata normal form. 101/1145 useless extension candidates. Maximal degree in co-relation 5546. Up to 817 conditions per place. [2022-12-05 20:27:08,984 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 70 selfloop transitions, 4 changer transitions 7/88 dead transitions. [2022-12-05 20:27:08,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 1094 flow [2022-12-05 20:27:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 20:27:08,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2022-12-05 20:27:08,985 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 674 flow. Second operand 3 states and 38 transitions. [2022-12-05 20:27:08,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 1094 flow [2022-12-05 20:27:08,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 1030 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-05 20:27:08,992 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 608 flow [2022-12-05 20:27:08,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2022-12-05 20:27:08,993 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-05 20:27:08,993 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 608 flow [2022-12-05 20:27:08,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:08,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:08,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:08,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:27:08,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1523538453, now seen corresponding path program 1 times [2022-12-05 20:27:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:08,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530742414] [2022-12-05 20:27:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:09,087 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:27:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:09,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530742414] [2022-12-05 20:27:09,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530742414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:09,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:09,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110131930] [2022-12-05 20:27:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:09,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:09,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 20:27:09,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 608 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:09,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:09,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 20:27:09,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:09,184 INFO L130 PetriNetUnfolder]: 291/582 cut-off events. [2022-12-05 20:27:09,184 INFO L131 PetriNetUnfolder]: For 3240/3282 co-relation queries the response was YES. [2022-12-05 20:27:09,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 582 events. 291/582 cut-off events. For 3240/3282 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2786 event pairs, 48 based on Foata normal form. 76/653 useless extension candidates. Maximal degree in co-relation 3034. Up to 247 conditions per place. [2022-12-05 20:27:09,187 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 71 selfloop transitions, 7 changer transitions 9/94 dead transitions. [2022-12-05 20:27:09,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 1099 flow [2022-12-05 20:27:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 20:27:09,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-05 20:27:09,188 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 608 flow. Second operand 4 states and 51 transitions. [2022-12-05 20:27:09,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 1099 flow [2022-12-05 20:27:09,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 1067 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:09,194 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 561 flow [2022-12-05 20:27:09,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2022-12-05 20:27:09,194 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2022-12-05 20:27:09,194 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 561 flow [2022-12-05 20:27:09,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:27:09,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:09,195 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:27:09,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:27:09,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1973337584, now seen corresponding path program 1 times [2022-12-05 20:27:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:09,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520499216] [2022-12-05 20:27:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:09,301 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:27:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520499216] [2022-12-05 20:27:09,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520499216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:09,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:09,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902807688] [2022-12-05 20:27:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:27:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:27:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:27:09,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 20:27:09,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 561 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:09,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:09,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 20:27:09,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:09,400 INFO L130 PetriNetUnfolder]: 241/479 cut-off events. [2022-12-05 20:27:09,400 INFO L131 PetriNetUnfolder]: For 2724/2765 co-relation queries the response was YES. [2022-12-05 20:27:09,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 479 events. 241/479 cut-off events. For 2724/2765 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2240 event pairs, 42 based on Foata normal form. 35/510 useless extension candidates. Maximal degree in co-relation 2557. Up to 193 conditions per place. [2022-12-05 20:27:09,403 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 44 selfloop transitions, 10 changer transitions 32/90 dead transitions. [2022-12-05 20:27:09,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 1039 flow [2022-12-05 20:27:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-12-05 20:27:09,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2022-12-05 20:27:09,420 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 561 flow. Second operand 5 states and 53 transitions. [2022-12-05 20:27:09,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 1039 flow [2022-12-05 20:27:09,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 974 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-05 20:27:09,426 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 332 flow [2022-12-05 20:27:09,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2022-12-05 20:27:09,426 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2022-12-05 20:27:09,426 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 332 flow [2022-12-05 20:27:09,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:09,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:09,427 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:27:09,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:27:09,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1762648743, now seen corresponding path program 1 times [2022-12-05 20:27:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:09,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863815852] [2022-12-05 20:27:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:10,323 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:27:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863815852] [2022-12-05 20:27:10,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863815852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:10,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:10,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:27:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440782530] [2022-12-05 20:27:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:10,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:27:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:27:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:27:10,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 20:27:10,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 332 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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:27:10,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:10,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 20:27:10,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:10,486 INFO L130 PetriNetUnfolder]: 138/268 cut-off events. [2022-12-05 20:27:10,486 INFO L131 PetriNetUnfolder]: For 1237/1237 co-relation queries the response was YES. [2022-12-05 20:27:10,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 268 events. 138/268 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 886 event pairs, 19 based on Foata normal form. 1/269 useless extension candidates. Maximal degree in co-relation 1369. Up to 149 conditions per place. [2022-12-05 20:27:10,487 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 39 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2022-12-05 20:27:10,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 657 flow [2022-12-05 20:27:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:27:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:27:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-05 20:27:10,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30246913580246915 [2022-12-05 20:27:10,489 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 332 flow. Second operand 6 states and 49 transitions. [2022-12-05 20:27:10,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 657 flow [2022-12-05 20:27:10,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 528 flow, removed 27 selfloop flow, removed 15 redundant places. [2022-12-05 20:27:10,492 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 223 flow [2022-12-05 20:27:10,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2022-12-05 20:27:10,492 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-05 20:27:10,492 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 223 flow [2022-12-05 20:27:10,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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:27:10,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:10,492 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:27:10,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:27:10,492 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 426861327, now seen corresponding path program 2 times [2022-12-05 20:27:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:10,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272975069] [2022-12-05 20:27:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:27:10,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:27:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:27:10,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:27:10,583 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:27:10,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:27:10,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:27:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:27:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:27:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:27:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:27:10,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:27:10,587 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:10,591 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:27:10,591 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:27:10,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:27:10 BasicIcfg [2022-12-05 20:27:10,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:27:10,636 INFO L158 Benchmark]: Toolchain (without parser) took 14575.96ms. Allocated memory was 209.7MB in the beginning and 730.9MB in the end (delta: 521.1MB). Free memory was 185.2MB in the beginning and 346.7MB in the end (delta: -161.5MB). Peak memory consumption was 361.6MB. Max. memory is 8.0GB. [2022-12-05 20:27:10,636 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory was 188.2MB in the beginning and 188.1MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:27:10,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.31ms. Allocated memory is still 209.7MB. Free memory was 185.0MB in the beginning and 158.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:27:10,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 209.7MB. Free memory was 158.8MB in the beginning and 156.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:10,636 INFO L158 Benchmark]: Boogie Preprocessor took 29.27ms. Allocated memory is still 209.7MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:10,636 INFO L158 Benchmark]: RCFGBuilder took 548.99ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 154.2MB in the beginning and 218.8MB in the end (delta: -64.7MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:10,637 INFO L158 Benchmark]: TraceAbstraction took 13512.36ms. Allocated memory was 251.7MB in the beginning and 730.9MB in the end (delta: 479.2MB). Free memory was 218.3MB in the beginning and 346.7MB in the end (delta: -128.4MB). Peak memory consumption was 352.4MB. Max. memory is 8.0GB. [2022-12-05 20:27:10,638 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.19ms. Allocated memory is still 209.7MB. Free memory was 188.2MB in the beginning and 188.1MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.31ms. Allocated memory is still 209.7MB. Free memory was 185.0MB in the beginning and 158.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.45ms. Allocated memory is still 209.7MB. Free memory was 158.8MB in the beginning and 156.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.27ms. Allocated memory is still 209.7MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 548.99ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 154.2MB in the beginning and 218.8MB in the end (delta: -64.7MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. * TraceAbstraction took 13512.36ms. Allocated memory was 251.7MB in the beginning and 730.9MB in the end (delta: 479.2MB). Free memory was 218.3MB in the beginning and 346.7MB in the end (delta: -128.4MB). Peak memory consumption was 352.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 110 PlacesBefore, 36 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 1265, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1111, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1111, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1317, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1111, unknown conditional: 0, unknown unconditional: 1111] , Statistics on independence cache: Total cache size (in pairs): 1720, Positive cache size: 1688, Positive conditional cache size: 0, Positive unconditional cache size: 1688, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - 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: 816]: 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: 818]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1043 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 15 mSDtfsCounter, 1043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=862occurred in iteration=10, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 2751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:27:10,657 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...