/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/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:27:58,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:27:58,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:27:58,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:27:58,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:27:58,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:27:58,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:27:58,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:27:58,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:27:58,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:27:58,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:27:58,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:27:58,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:27:58,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:27:58,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:27:58,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:27:58,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:27:58,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:27:58,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:27:58,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:27:58,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:27:58,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:27:58,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:27:58,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:27:58,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:27:58,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:27:58,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:27:58,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:27:58,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:27:58,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:27:58,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:27:58,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:27:58,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:27:58,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:27:58,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:27:58,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:27:58,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:27:58,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:27:58,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:27:58,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:27:58,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:27:58,153 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:27:58,191 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:27:58,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:27:58,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:27:58,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:27:58,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:27:58,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:27:58,195 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:27:58,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:27:58,195 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:27:58,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:27:58,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:27:58,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:27:58,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:27:58,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:27:58,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:27:58,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:27:58,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:27:58,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:27:58,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:27:58,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:27:58,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:27:58,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:27:58,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:27:58,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:27:58,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:27:58,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:27:58,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:27:58,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:27:58,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:27:58,199 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:27:58,199 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:27:58,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:27:58,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:27:58,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:27:58,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:27:58,544 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:27:58,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:27:59,709 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:27:59,984 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:27:59,984 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:27:59,998 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88775910d/25142a62dcd14bbbb6737fd04e8bcef2/FLAG415e1d426 [2022-12-05 20:28:00,010 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88775910d/25142a62dcd14bbbb6737fd04e8bcef2 [2022-12-05 20:28:00,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:28:00,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:28:00,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:00,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:28:00,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:28:00,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e1c23b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00, skipping insertion in model container [2022-12-05 20:28:00,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:28:00,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:28:00,199 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 20:28:00,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:00,396 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:28:00,412 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 20:28:00,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:00,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:00,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:00,518 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:28:00,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00 WrapperNode [2022-12-05 20:28:00,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:00,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:00,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:28:00,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:28:00,525 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:28:00" (1/1) ... [2022-12-05 20:28:00,555 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:28:00" (1/1) ... [2022-12-05 20:28:00,592 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-05 20:28:00,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:00,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:28:00,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:28:00,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:28:00,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,630 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:28:00,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:28:00,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:28:00,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:28:00,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (1/1) ... [2022-12-05 20:28:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:28:00,682 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:28:00,695 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:28:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:28:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:28:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:28:00,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:28:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:28:00,726 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:28:00,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:28:00,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:28:00,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:28:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:28:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:28:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:28:00,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:28:00,729 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:28:00,877 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:28:00,880 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:28:01,212 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:28:01,353 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:28:01,353 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:28:01,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:01 BoogieIcfgContainer [2022-12-05 20:28:01,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:28:01,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:28:01,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:28:01,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:28:01,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:28:00" (1/3) ... [2022-12-05 20:28:01,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb7856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:01, skipping insertion in model container [2022-12-05 20:28:01,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:00" (2/3) ... [2022-12-05 20:28:01,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb7856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:01, skipping insertion in model container [2022-12-05 20:28:01,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:01" (3/3) ... [2022-12-05 20:28:01,363 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:28:01,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:28:01,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:28:01,379 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:28:01,425 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:28:01,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 20:28:01,539 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 20:28:01,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:01,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 20:28:01,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 20:28:01,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-05 20:28:01,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:28:01,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 20:28:01,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-05 20:28:01,618 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 20:28:01,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:01,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 20:28:01,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 20:28:01,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-05 20:28:06,005 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-05 20:28:06,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:28:06,023 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;@6595f109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:28:06,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 20:28:06,025 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 20:28:06,025 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:06,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:06,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:28:06,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash 379307268, now seen corresponding path program 1 times [2022-12-05 20:28:06,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:06,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768095181] [2022-12-05 20:28:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:06,383 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:28:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:06,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768095181] [2022-12-05 20:28:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768095181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:06,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:06,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762885749] [2022-12-05 20:28:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:06,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:06,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 20:28:06,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:28:06,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:06,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 20:28:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:06,517 INFO L130 PetriNetUnfolder]: 135/265 cut-off events. [2022-12-05 20:28:06,517 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:28:06,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 265 events. 135/265 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1095 event pairs, 21 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 509. Up to 187 conditions per place. [2022-12-05 20:28:06,520 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 17 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-05 20:28:06,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 102 flow [2022-12-05 20:28:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 20:28:06,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-05 20:28:06,533 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 34 transitions. [2022-12-05 20:28:06,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 102 flow [2022-12-05 20:28:06,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:06,537 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-05 20:28:06,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-05 20:28:06,541 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-05 20:28:06,542 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2022-12-05 20:28:06,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:28:06,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:06,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:06,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:28:06,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -557900278, now seen corresponding path program 1 times [2022-12-05 20:28:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:06,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439035924] [2022-12-05 20:28:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:06,814 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:28:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:06,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439035924] [2022-12-05 20:28:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439035924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142106388] [2022-12-05 20:28:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:06,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:06,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:06,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:06,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:06,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:28:06,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:06,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:06,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:06,884 INFO L130 PetriNetUnfolder]: 107/202 cut-off events. [2022-12-05 20:28:06,884 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 20:28:06,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 202 events. 107/202 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 700 event pairs, 41 based on Foata normal form. 2/204 useless extension candidates. Maximal degree in co-relation 415. Up to 184 conditions per place. [2022-12-05 20:28:06,889 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-05 20:28:06,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 98 flow [2022-12-05 20:28:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 20:28:06,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:28:06,891 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 3 states and 25 transitions. [2022-12-05 20:28:06,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 98 flow [2022-12-05 20:28:06,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:06,893 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-05 20:28:06,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-05 20:28:06,894 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-05 20:28:06,894 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-05 20:28:06,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:28:06,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:06,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:06,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:28:06,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -115040153, now seen corresponding path program 1 times [2022-12-05 20:28:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:06,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544410940] [2022-12-05 20:28:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:07,421 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:28:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:07,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544410940] [2022-12-05 20:28:07,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544410940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:07,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:07,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:28:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157223828] [2022-12-05 20:28:07,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:07,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:07,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:07,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:07,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:07,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.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:28:07,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:07,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:07,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:07,497 INFO L130 PetriNetUnfolder]: 123/230 cut-off events. [2022-12-05 20:28:07,497 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 20:28:07,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 230 events. 123/230 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 792 event pairs, 61 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 522. Up to 202 conditions per place. [2022-12-05 20:28:07,501 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 19 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2022-12-05 20:28:07,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 131 flow [2022-12-05 20:28:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 20:28:07,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-05 20:28:07,504 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 29 transitions. [2022-12-05 20:28:07,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 131 flow [2022-12-05 20:28:07,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:07,506 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 87 flow [2022-12-05 20:28:07,506 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2022-12-05 20:28:07,507 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-05 20:28:07,507 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 87 flow [2022-12-05 20:28:07,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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:28:07,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:07,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:07,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:28:07,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:07,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1939332874, now seen corresponding path program 1 times [2022-12-05 20:28:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:07,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170445129] [2022-12-05 20:28:07,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:08,036 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:28:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170445129] [2022-12-05 20:28:08,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170445129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:08,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:08,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961596874] [2022-12-05 20:28:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:08,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:08,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:08,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:28:08,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:08,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:08,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:08,172 INFO L130 PetriNetUnfolder]: 126/236 cut-off events. [2022-12-05 20:28:08,172 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-05 20:28:08,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 236 events. 126/236 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 853 event pairs, 33 based on Foata normal form. 3/235 useless extension candidates. Maximal degree in co-relation 617. Up to 173 conditions per place. [2022-12-05 20:28:08,175 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 24 selfloop transitions, 11 changer transitions 0/37 dead transitions. [2022-12-05 20:28:08,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 203 flow [2022-12-05 20:28:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-05 20:28:08,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-05 20:28:08,179 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 87 flow. Second operand 5 states and 37 transitions. [2022-12-05 20:28:08,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 203 flow [2022-12-05 20:28:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:28:08,183 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 141 flow [2022-12-05 20:28:08,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-05 20:28:08,184 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2022-12-05 20:28:08,184 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 141 flow [2022-12-05 20:28:08,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:28:08,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:08,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:08,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:28:08,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:08,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1939379002, now seen corresponding path program 1 times [2022-12-05 20:28:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:08,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245228519] [2022-12-05 20:28:08,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:08,613 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:28:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245228519] [2022-12-05 20:28:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245228519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:08,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:08,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:08,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878683855] [2022-12-05 20:28:08,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:08,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:08,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:08,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:08,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:28:08,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:08,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:08,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:08,740 INFO L130 PetriNetUnfolder]: 114/219 cut-off events. [2022-12-05 20:28:08,741 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-12-05 20:28:08,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 219 events. 114/219 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 754 event pairs, 34 based on Foata normal form. 5/224 useless extension candidates. Maximal degree in co-relation 693. Up to 154 conditions per place. [2022-12-05 20:28:08,743 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 28 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2022-12-05 20:28:08,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 265 flow [2022-12-05 20:28:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-05 20:28:08,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 20:28:08,746 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 141 flow. Second operand 4 states and 35 transitions. [2022-12-05 20:28:08,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 265 flow [2022-12-05 20:28:08,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 261 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 20:28:08,750 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 196 flow [2022-12-05 20:28:08,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-05 20:28:08,752 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2022-12-05 20:28:08,752 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 196 flow [2022-12-05 20:28:08,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:28:08,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:08,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:08,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:28:08,754 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -10225536, now seen corresponding path program 1 times [2022-12-05 20:28:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:08,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58880700] [2022-12-05 20:28:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:09,462 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:28:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:09,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58880700] [2022-12-05 20:28:09,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58880700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:09,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:09,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238367308] [2022-12-05 20:28:09,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:09,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:09,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:09,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:28:09,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:09,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:09,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:09,623 INFO L130 PetriNetUnfolder]: 113/216 cut-off events. [2022-12-05 20:28:09,624 INFO L131 PetriNetUnfolder]: For 516/520 co-relation queries the response was YES. [2022-12-05 20:28:09,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 216 events. 113/216 cut-off events. For 516/520 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 749 event pairs, 23 based on Foata normal form. 2/216 useless extension candidates. Maximal degree in co-relation 809. Up to 162 conditions per place. [2022-12-05 20:28:09,626 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 32 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2022-12-05 20:28:09,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 320 flow [2022-12-05 20:28:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-05 20:28:09,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-05 20:28:09,627 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 196 flow. Second operand 5 states and 37 transitions. [2022-12-05 20:28:09,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 320 flow [2022-12-05 20:28:09,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:09,631 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 224 flow [2022-12-05 20:28:09,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-05 20:28:09,632 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2022-12-05 20:28:09,632 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 224 flow [2022-12-05 20:28:09,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:28:09,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:09,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:28:09,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1113079216, now seen corresponding path program 1 times [2022-12-05 20:28:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:09,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452500473] [2022-12-05 20:28:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:09,765 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:28:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:09,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452500473] [2022-12-05 20:28:09,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452500473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:09,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:09,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:28:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553298766] [2022-12-05 20:28:09,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:09,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:09,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:28:09,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:09,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:09,857 INFO L130 PetriNetUnfolder]: 155/295 cut-off events. [2022-12-05 20:28:09,857 INFO L131 PetriNetUnfolder]: For 731/739 co-relation queries the response was YES. [2022-12-05 20:28:09,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 295 events. 155/295 cut-off events. For 731/739 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1140 event pairs, 58 based on Foata normal form. 18/309 useless extension candidates. Maximal degree in co-relation 1084. Up to 170 conditions per place. [2022-12-05 20:28:09,860 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 31 selfloop transitions, 3 changer transitions 6/44 dead transitions. [2022-12-05 20:28:09,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 364 flow [2022-12-05 20:28:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 20:28:09,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:28:09,862 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 224 flow. Second operand 3 states and 25 transitions. [2022-12-05 20:28:09,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 364 flow [2022-12-05 20:28:09,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 349 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:09,867 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 212 flow [2022-12-05 20:28:09,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-05 20:28:09,867 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2022-12-05 20:28:09,868 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 212 flow [2022-12-05 20:28:09,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:28:09,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:09,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:09,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:28:09,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:09,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1531907715, now seen corresponding path program 1 times [2022-12-05 20:28:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:09,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923497586] [2022-12-05 20:28:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:10,415 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:28:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:10,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923497586] [2022-12-05 20:28:10,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923497586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:10,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:10,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288171988] [2022-12-05 20:28:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:10,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:10,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:10,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:28:10,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:10,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:10,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:10,591 INFO L130 PetriNetUnfolder]: 149/294 cut-off events. [2022-12-05 20:28:10,591 INFO L131 PetriNetUnfolder]: For 700/708 co-relation queries the response was YES. [2022-12-05 20:28:10,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 294 events. 149/294 cut-off events. For 700/708 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1159 event pairs, 26 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 1104. Up to 194 conditions per place. [2022-12-05 20:28:10,593 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 25 selfloop transitions, 10 changer transitions 6/43 dead transitions. [2022-12-05 20:28:10,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 339 flow [2022-12-05 20:28:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-05 20:28:10,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-05 20:28:10,595 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 212 flow. Second operand 5 states and 38 transitions. [2022-12-05 20:28:10,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 339 flow [2022-12-05 20:28:10,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 329 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:10,598 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 211 flow [2022-12-05 20:28:10,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2022-12-05 20:28:10,599 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-12-05 20:28:10,599 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 211 flow [2022-12-05 20:28:10,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:28:10,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:10,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:10,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:28:10,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -316948935, now seen corresponding path program 2 times [2022-12-05 20:28:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:10,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386549495] [2022-12-05 20:28:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:11,202 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:28:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386549495] [2022-12-05 20:28:11,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386549495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:11,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:11,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:28:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877817844] [2022-12-05 20:28:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:11,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:28:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:28:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:28:11,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:11,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:28:11,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:11,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:11,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:11,381 INFO L130 PetriNetUnfolder]: 122/238 cut-off events. [2022-12-05 20:28:11,381 INFO L131 PetriNetUnfolder]: For 755/761 co-relation queries the response was YES. [2022-12-05 20:28:11,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 238 events. 122/238 cut-off events. For 755/761 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 873 event pairs, 13 based on Foata normal form. 4/242 useless extension candidates. Maximal degree in co-relation 935. Up to 151 conditions per place. [2022-12-05 20:28:11,383 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 19 selfloop transitions, 6 changer transitions 13/39 dead transitions. [2022-12-05 20:28:11,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 331 flow [2022-12-05 20:28:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-05 20:28:11,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-05 20:28:11,386 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 211 flow. Second operand 5 states and 35 transitions. [2022-12-05 20:28:11,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 331 flow [2022-12-05 20:28:11,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 306 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-05 20:28:11,389 INFO L231 Difference]: Finished difference. Result has 46 places, 21 transitions, 155 flow [2022-12-05 20:28:11,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=21} [2022-12-05 20:28:11,390 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2022-12-05 20:28:11,391 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 21 transitions, 155 flow [2022-12-05 20:28:11,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:28:11,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:11,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:11,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:28:11,391 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 147174849, now seen corresponding path program 1 times [2022-12-05 20:28:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:11,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019555189] [2022-12-05 20:28:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:11,534 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:28:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:11,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019555189] [2022-12-05 20:28:11,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019555189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:11,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:11,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097923055] [2022-12-05 20:28:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:11,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:11,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 20:28:11,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 21 transitions, 155 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:28:11,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:11,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 20:28:11,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:11,603 INFO L130 PetriNetUnfolder]: 34/85 cut-off events. [2022-12-05 20:28:11,603 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-05 20:28:11,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 85 events. 34/85 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 228 event pairs, 6 based on Foata normal form. 13/97 useless extension candidates. Maximal degree in co-relation 346. Up to 41 conditions per place. [2022-12-05 20:28:11,604 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2022-12-05 20:28:11,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 339 flow [2022-12-05 20:28:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-05 20:28:11,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-05 20:28:11,605 INFO L175 Difference]: Start difference. First operand has 46 places, 21 transitions, 155 flow. Second operand 5 states and 42 transitions. [2022-12-05 20:28:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 339 flow [2022-12-05 20:28:11,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 271 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-12-05 20:28:11,608 INFO L231 Difference]: Finished difference. Result has 39 places, 21 transitions, 131 flow [2022-12-05 20:28:11,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2022-12-05 20:28:11,608 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2022-12-05 20:28:11,609 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 131 flow [2022-12-05 20:28:11,609 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:28:11,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:11,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:11,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:28:11,609 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -106143679, now seen corresponding path program 1 times [2022-12-05 20:28:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:11,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124085933] [2022-12-05 20:28:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:11,726 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:28:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124085933] [2022-12-05 20:28:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124085933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:11,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:11,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:11,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086355558] [2022-12-05 20:28:11,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:11,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:11,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:11,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 20:28:11,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:28:11,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:11,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 20:28:11,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:11,792 INFO L130 PetriNetUnfolder]: 11/39 cut-off events. [2022-12-05 20:28:11,792 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-05 20:28:11,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 39 events. 11/39 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 6/45 useless extension candidates. Maximal degree in co-relation 151. Up to 16 conditions per place. [2022-12-05 20:28:11,793 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 16 selfloop transitions, 5 changer transitions 6/30 dead transitions. [2022-12-05 20:28:11,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 235 flow [2022-12-05 20:28:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-05 20:28:11,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-05 20:28:11,794 INFO L175 Difference]: Start difference. First operand has 39 places, 21 transitions, 131 flow. Second operand 6 states and 38 transitions. [2022-12-05 20:28:11,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 235 flow [2022-12-05 20:28:11,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 174 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-05 20:28:11,796 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 108 flow [2022-12-05 20:28:11,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2022-12-05 20:28:11,796 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2022-12-05 20:28:11,797 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 108 flow [2022-12-05 20:28:11,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:28:11,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:11,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:11,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:28:11,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:11,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1130731259, now seen corresponding path program 1 times [2022-12-05 20:28:11,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:11,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782721499] [2022-12-05 20:28:11,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:11,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782721499] [2022-12-05 20:28:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782721499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634791123] [2022-12-05 20:28:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:12,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:12,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:28:12,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:28:12,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:12,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:28:12,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:12,363 INFO L130 PetriNetUnfolder]: 9/40 cut-off events. [2022-12-05 20:28:12,363 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-05 20:28:12,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 40 events. 9/40 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 3 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 139. Up to 21 conditions per place. [2022-12-05 20:28:12,364 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 13 selfloop transitions, 6 changer transitions 9/29 dead transitions. [2022-12-05 20:28:12,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 219 flow [2022-12-05 20:28:12,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-12-05 20:28:12,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24166666666666667 [2022-12-05 20:28:12,365 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 108 flow. Second operand 6 states and 29 transitions. [2022-12-05 20:28:12,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 219 flow [2022-12-05 20:28:12,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 184 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-05 20:28:12,367 INFO L231 Difference]: Finished difference. Result has 37 places, 19 transitions, 101 flow [2022-12-05 20:28:12,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2022-12-05 20:28:12,367 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-05 20:28:12,367 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 101 flow [2022-12-05 20:28:12,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:28:12,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:12,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:28:12,368 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:28:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 315265887, now seen corresponding path program 2 times [2022-12-05 20:28:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617418323] [2022-12-05 20:28:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:12,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:28:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:12,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:28:12,441 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:28:12,442 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 20:28:12,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 20:28:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 20:28:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 20:28:12,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 20:28:12,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:28:12,444 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:12,450 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:28:12,450 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:28:12,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:28:12 BasicIcfg [2022-12-05 20:28:12,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:28:12,513 INFO L158 Benchmark]: Toolchain (without parser) took 12499.82ms. Allocated memory was 185.6MB in the beginning and 346.0MB in the end (delta: 160.4MB). Free memory was 160.7MB in the beginning and 135.2MB in the end (delta: 25.5MB). Peak memory consumption was 186.5MB. Max. memory is 8.0GB. [2022-12-05 20:28:12,513 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:28:12,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.81ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 136.1MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:12,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.23ms. Allocated memory is still 185.6MB. Free memory was 136.1MB in the beginning and 133.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:12,514 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 185.6MB. Free memory was 133.4MB in the beginning and 131.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 20:28:12,514 INFO L158 Benchmark]: RCFGBuilder took 705.09ms. Allocated memory is still 185.6MB. Free memory was 131.9MB in the beginning and 100.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 20:28:12,514 INFO L158 Benchmark]: TraceAbstraction took 11154.36ms. Allocated memory was 185.6MB in the beginning and 346.0MB in the end (delta: 160.4MB). Free memory was 99.9MB in the beginning and 135.2MB in the end (delta: -35.3MB). Peak memory consumption was 125.7MB. Max. memory is 8.0GB. [2022-12-05 20:28:12,522 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 504.81ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 136.1MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.23ms. Allocated memory is still 185.6MB. Free memory was 136.1MB in the beginning and 133.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 185.6MB. Free memory was 133.4MB in the beginning and 131.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 705.09ms. Allocated memory is still 185.6MB. Free memory was 131.9MB in the beginning and 100.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11154.36ms. Allocated memory was 185.6MB in the beginning and 346.0MB in the end (delta: 160.4MB). Free memory was 99.9MB in the beginning and 135.2MB in the end (delta: -35.3MB). Peak memory consumption was 125.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 89 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 20 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 867, independent: 826, independent conditional: 826, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 867, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 867, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 867, independent: 826, independent conditional: 0, independent unconditional: 826, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 669, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 669, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 227, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 867, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , Statistics on independence cache: Total cache size (in pairs): 1045, Positive cache size: 1014, Positive conditional cache size: 0, Positive unconditional cache size: 1014, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=1, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 104 locations, 5 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: 11.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 9 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=6, InterpolantAutomatonStates: 54, 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.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:28:12,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...