/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/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:35:42,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:35:42,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:35:42,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:35:42,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:35:42,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:35:42,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:35:42,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:35:42,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:35:42,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:35:42,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:35:42,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:35:42,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:35:42,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:35:42,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:35:42,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:35:42,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:35:42,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:35:42,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:35:42,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:35:42,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:35:42,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:35:42,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:35:42,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:35:42,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:35:42,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:35:42,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:35:42,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:35:42,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:35:42,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:35:42,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:35:42,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:35:42,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:35:42,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:35:42,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:35:42,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:35:42,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:35:42,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:35:42,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:35:42,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:35:42,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:35:42,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-12 14:35:42,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:35:42,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:35:42,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:35:42,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:35:42,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:35:42,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:35:42,180 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:35:42,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:35:42,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:35:42,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:35:42,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:35:42,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:35:42,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:35:42,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:35:42,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:35:42,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:35:42,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:35:42,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:35:42,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:35:42,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:35:42,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:35:42,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:35:42,183 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-12 14:35:42,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:35:42,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:35:42,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:35:42,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:35:42,490 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:35:42,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 14:35:43,469 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:35:43,660 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:35:43,660 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 14:35:43,682 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86fce47/29cc25a3d1a44337bee1a7de42f0f2b8/FLAGf5fa3374a [2022-12-12 14:35:43,697 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86fce47/29cc25a3d1a44337bee1a7de42f0f2b8 [2022-12-12 14:35:43,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:35:43,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:35:43,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:35:43,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:35:43,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:35:43,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:35:43" (1/1) ... [2022-12-12 14:35:43,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bf7ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:43, skipping insertion in model container [2022-12-12 14:35:43,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:35:43" (1/1) ... [2022-12-12 14:35:43,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:35:43,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:35:43,839 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 14:35:43,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:43,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:43,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:35:44,036 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:35:44,050 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 14:35:44,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:44,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:44,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:35:44,150 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:35:44,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44 WrapperNode [2022-12-12 14:35:44,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:35:44,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:35:44,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:35:44,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:35:44,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,211 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-12 14:35:44,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:35:44,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:35:44,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:35:44,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:35:44,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:35:44,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:35:44,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:35:44,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:35:44,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (1/1) ... [2022-12-12 14:35:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:35:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:35:44,296 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-12 14:35:44,312 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-12 14:35:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:35:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:35:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:35:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:35:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:35:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:35:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:35:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:35:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:35:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:35:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:35:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:35:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:35:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:35:44,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:35:44,329 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:35:44,453 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:35:44,455 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:35:44,692 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:35:44,786 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:35:44,786 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:35:44,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:35:44 BoogieIcfgContainer [2022-12-12 14:35:44,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:35:44,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:35:44,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:35:44,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:35:44,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:35:43" (1/3) ... [2022-12-12 14:35:44,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48935a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:35:44, skipping insertion in model container [2022-12-12 14:35:44,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:44" (2/3) ... [2022-12-12 14:35:44,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48935a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:35:44, skipping insertion in model container [2022-12-12 14:35:44,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:35:44" (3/3) ... [2022-12-12 14:35:44,794 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 14:35:44,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:35:44,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:35:44,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:35:44,850 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:35:44,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 14:35:44,936 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 14:35:44,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:35:44,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 14:35:44,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 14:35:44,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:44,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:35:44,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:44,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:45,011 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 14:35:45,012 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:35:45,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-12 14:35:45,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:45,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-12 14:35:49,193 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-12 14:35:49,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:35:49,208 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;@2f2075d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:35:49,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:35:49,210 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 14:35:49,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:35:49,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:49,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 14:35:49,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash 515099, now seen corresponding path program 1 times [2022-12-12 14:35:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:49,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344579357] [2022-12-12 14:35:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:49,524 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-12 14:35:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344579357] [2022-12-12 14:35:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344579357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:49,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:49,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:35:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065822168] [2022-12-12 14:35:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:49,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:49,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 69 [2022-12-12 14:35:49,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-12 14:35:49,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:49,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 69 [2022-12-12 14:35:49,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:50,891 INFO L130 PetriNetUnfolder]: 10840/17378 cut-off events. [2022-12-12 14:35:50,892 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 14:35:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 17378 events. 10840/17378 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 136902 event pairs, 1440 based on Foata normal form. 0/10486 useless extension candidates. Maximal degree in co-relation 32830. Up to 13045 conditions per place. [2022-12-12 14:35:50,955 INFO L137 encePairwiseOnDemand]: 63/69 looper letters, 38 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-12 14:35:50,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 433 flow [2022-12-12 14:35:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-12-12 14:35:50,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2022-12-12 14:35:50,967 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 147 flow. Second operand 3 states and 144 transitions. [2022-12-12 14:35:50,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 433 flow [2022-12-12 14:35:50,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:35:50,972 INFO L231 Difference]: Finished difference. Result has 74 places, 35 transitions, 80 flow [2022-12-12 14:35:50,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=74, PETRI_TRANSITIONS=35} [2022-12-12 14:35:50,975 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-12 14:35:50,976 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 35 transitions, 80 flow [2022-12-12 14:35:50,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-12 14:35:50,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:50,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:50,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:35:50,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash 5120902, now seen corresponding path program 1 times [2022-12-12 14:35:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:50,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384881852] [2022-12-12 14:35:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:50,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:51,167 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-12 14:35:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:51,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384881852] [2022-12-12 14:35:51,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384881852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:51,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:51,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:35:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960272984] [2022-12-12 14:35:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:51,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:51,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 14:35:51,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-12 14:35:51,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:51,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 14:35:51,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:51,735 INFO L130 PetriNetUnfolder]: 5349/8207 cut-off events. [2022-12-12 14:35:51,735 INFO L131 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-12-12 14:35:51,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16384 conditions, 8207 events. 5349/8207 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 49087 event pairs, 1737 based on Foata normal form. 0/6457 useless extension candidates. Maximal degree in co-relation 16374. Up to 5005 conditions per place. [2022-12-12 14:35:51,777 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 41 selfloop transitions, 6 changer transitions 2/57 dead transitions. [2022-12-12 14:35:51,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 226 flow [2022-12-12 14:35:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-12 14:35:51,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3719806763285024 [2022-12-12 14:35:51,780 INFO L175 Difference]: Start difference. First operand has 74 places, 35 transitions, 80 flow. Second operand 3 states and 77 transitions. [2022-12-12 14:35:51,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 226 flow [2022-12-12 14:35:51,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:35:51,782 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 120 flow [2022-12-12 14:35:51,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-12 14:35:51,783 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-12 14:35:51,783 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 120 flow [2022-12-12 14:35:51,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-12 14:35:51,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:51,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:51,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:35:51,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 158748357, now seen corresponding path program 1 times [2022-12-12 14:35:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:51,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585200729] [2022-12-12 14:35:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:51,945 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-12 14:35:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585200729] [2022-12-12 14:35:51,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585200729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:51,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:51,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:35:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276501505] [2022-12-12 14:35:51,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:51,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:35:51,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:35:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:35:51,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 14:35:51,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-12 14:35:51,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:51,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 14:35:51,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:52,454 INFO L130 PetriNetUnfolder]: 3848/5987 cut-off events. [2022-12-12 14:35:52,454 INFO L131 PetriNetUnfolder]: For 1882/1882 co-relation queries the response was YES. [2022-12-12 14:35:52,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13767 conditions, 5987 events. 3848/5987 cut-off events. For 1882/1882 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 33201 event pairs, 1280 based on Foata normal form. 90/4996 useless extension candidates. Maximal degree in co-relation 13755. Up to 2621 conditions per place. [2022-12-12 14:35:52,480 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 47 selfloop transitions, 7 changer transitions 1/63 dead transitions. [2022-12-12 14:35:52,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 292 flow [2022-12-12 14:35:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-12 14:35:52,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.322463768115942 [2022-12-12 14:35:52,482 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 120 flow. Second operand 4 states and 89 transitions. [2022-12-12 14:35:52,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 292 flow [2022-12-12 14:35:52,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:35:52,487 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 154 flow [2022-12-12 14:35:52,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-12 14:35:52,488 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-12 14:35:52,488 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 154 flow [2022-12-12 14:35:52,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-12 14:35:52,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:52,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:52,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:35:52,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:52,489 INFO L85 PathProgramCache]: Analyzing trace with hash 552370264, now seen corresponding path program 1 times [2022-12-12 14:35:52,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:52,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417132976] [2022-12-12 14:35:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:52,586 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-12 14:35:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:52,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417132976] [2022-12-12 14:35:52,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417132976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:52,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:52,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:35:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223793047] [2022-12-12 14:35:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:52,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:35:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:52,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:35:52,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:35:52,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 14:35:52,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:35:52,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:52,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 14:35:52,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:53,012 INFO L130 PetriNetUnfolder]: 3404/5365 cut-off events. [2022-12-12 14:35:53,012 INFO L131 PetriNetUnfolder]: For 3155/3155 co-relation queries the response was YES. [2022-12-12 14:35:53,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 5365 events. 3404/5365 cut-off events. For 3155/3155 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 31108 event pairs, 664 based on Foata normal form. 10/4536 useless extension candidates. Maximal degree in co-relation 13075. Up to 3201 conditions per place. [2022-12-12 14:35:53,038 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 50 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2022-12-12 14:35:53,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 366 flow [2022-12-12 14:35:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 14:35:53,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3442028985507246 [2022-12-12 14:35:53,041 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 154 flow. Second operand 4 states and 95 transitions. [2022-12-12 14:35:53,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 366 flow [2022-12-12 14:35:53,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:35:53,046 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 223 flow [2022-12-12 14:35:53,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-12 14:35:53,047 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2022-12-12 14:35:53,047 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 223 flow [2022-12-12 14:35:53,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:35:53,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:53,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:53,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:35:53,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -56292025, now seen corresponding path program 1 times [2022-12-12 14:35:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:53,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411141339] [2022-12-12 14:35:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:53,163 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-12 14:35:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:53,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411141339] [2022-12-12 14:35:53,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411141339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:53,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:53,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:35:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206343348] [2022-12-12 14:35:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:53,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:53,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 69 [2022-12-12 14:35:53,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-12 14:35:53,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:53,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 69 [2022-12-12 14:35:53,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:53,571 INFO L130 PetriNetUnfolder]: 3616/5747 cut-off events. [2022-12-12 14:35:53,571 INFO L131 PetriNetUnfolder]: For 3953/4092 co-relation queries the response was YES. [2022-12-12 14:35:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14107 conditions, 5747 events. 3616/5747 cut-off events. For 3953/4092 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34487 event pairs, 1013 based on Foata normal form. 109/4133 useless extension candidates. Maximal degree in co-relation 14089. Up to 5383 conditions per place. [2022-12-12 14:35:53,594 INFO L137 encePairwiseOnDemand]: 58/69 looper letters, 44 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2022-12-12 14:35:53,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 419 flow [2022-12-12 14:35:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-12 14:35:53,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3671497584541063 [2022-12-12 14:35:53,596 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 223 flow. Second operand 3 states and 76 transitions. [2022-12-12 14:35:53,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 419 flow [2022-12-12 14:35:53,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 417 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-12 14:35:53,600 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 289 flow [2022-12-12 14:35:53,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2022-12-12 14:35:53,602 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-12 14:35:53,602 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 289 flow [2022-12-12 14:35:53,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-12 14:35:53,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:53,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:53,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:35:53,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1095923880, now seen corresponding path program 1 times [2022-12-12 14:35:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:53,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925013043] [2022-12-12 14:35:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:53,747 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-12 14:35:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:53,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925013043] [2022-12-12 14:35:53,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925013043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:53,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:53,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:53,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362587643] [2022-12-12 14:35:53,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:35:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:53,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:35:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:35:53,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 69 [2022-12-12 14:35:53,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 289 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:35:53,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:53,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 69 [2022-12-12 14:35:53,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:54,074 INFO L130 PetriNetUnfolder]: 1745/3223 cut-off events. [2022-12-12 14:35:54,075 INFO L131 PetriNetUnfolder]: For 2127/2156 co-relation queries the response was YES. [2022-12-12 14:35:54,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9876 conditions, 3223 events. 1745/3223 cut-off events. For 2127/2156 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20874 event pairs, 252 based on Foata normal form. 251/2517 useless extension candidates. Maximal degree in co-relation 9855. Up to 2179 conditions per place. [2022-12-12 14:35:54,091 INFO L137 encePairwiseOnDemand]: 58/69 looper letters, 55 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2022-12-12 14:35:54,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 591 flow [2022-12-12 14:35:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-12 14:35:54,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-12-12 14:35:54,092 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 289 flow. Second operand 4 states and 104 transitions. [2022-12-12 14:35:54,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 591 flow [2022-12-12 14:35:54,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:35:54,097 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 391 flow [2022-12-12 14:35:54,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-12 14:35:54,098 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-12 14:35:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 391 flow [2022-12-12 14:35:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:35:54,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:54,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:54,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:35:54,099 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1896419106, now seen corresponding path program 1 times [2022-12-12 14:35:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:54,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100986918] [2022-12-12 14:35:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:54,268 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-12 14:35:54,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:54,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100986918] [2022-12-12 14:35:54,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100986918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:54,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:54,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554537178] [2022-12-12 14:35:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:35:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:35:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:35:54,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 69 [2022-12-12 14:35:54,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:35:54,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:54,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 69 [2022-12-12 14:35:54,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:54,675 INFO L130 PetriNetUnfolder]: 2357/4325 cut-off events. [2022-12-12 14:35:54,675 INFO L131 PetriNetUnfolder]: For 5761/6254 co-relation queries the response was YES. [2022-12-12 14:35:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15749 conditions, 4325 events. 2357/4325 cut-off events. For 5761/6254 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29400 event pairs, 604 based on Foata normal form. 355/3985 useless extension candidates. Maximal degree in co-relation 15726. Up to 2228 conditions per place. [2022-12-12 14:35:54,698 INFO L137 encePairwiseOnDemand]: 64/69 looper letters, 62 selfloop transitions, 9 changer transitions 13/98 dead transitions. [2022-12-12 14:35:54,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 732 flow [2022-12-12 14:35:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-12 14:35:54,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.322463768115942 [2022-12-12 14:35:54,700 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 391 flow. Second operand 4 states and 89 transitions. [2022-12-12 14:35:54,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 732 flow [2022-12-12 14:35:54,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 670 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-12 14:35:54,710 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 350 flow [2022-12-12 14:35:54,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-12 14:35:54,711 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-12 14:35:54,711 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 350 flow [2022-12-12 14:35:54,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:35:54,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:54,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:54,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:35:54,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1282279666, now seen corresponding path program 1 times [2022-12-12 14:35:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:54,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192324129] [2022-12-12 14:35:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:54,868 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-12 14:35:54,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:54,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192324129] [2022-12-12 14:35:54,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192324129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:54,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:54,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:54,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019558880] [2022-12-12 14:35:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:54,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:35:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:54,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:35:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:35:54,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 69 [2022-12-12 14:35:54,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-12 14:35:54,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:54,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 69 [2022-12-12 14:35:54,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:55,302 INFO L130 PetriNetUnfolder]: 2938/5550 cut-off events. [2022-12-12 14:35:55,302 INFO L131 PetriNetUnfolder]: For 6516/6992 co-relation queries the response was YES. [2022-12-12 14:35:55,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18095 conditions, 5550 events. 2938/5550 cut-off events. For 6516/6992 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 42948 event pairs, 743 based on Foata normal form. 353/4889 useless extension candidates. Maximal degree in co-relation 18071. Up to 2887 conditions per place. [2022-12-12 14:35:55,325 INFO L137 encePairwiseOnDemand]: 66/69 looper letters, 60 selfloop transitions, 2 changer transitions 20/102 dead transitions. [2022-12-12 14:35:55,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 720 flow [2022-12-12 14:35:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-12 14:35:55,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 14:35:55,327 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 350 flow. Second operand 4 states and 92 transitions. [2022-12-12 14:35:55,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 720 flow [2022-12-12 14:35:55,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 684 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-12 14:35:55,334 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 328 flow [2022-12-12 14:35:55,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-12-12 14:35:55,335 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -16 predicate places. [2022-12-12 14:35:55,335 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 328 flow [2022-12-12 14:35:55,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-12 14:35:55,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:55,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:55,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:35:55,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1548438354, now seen corresponding path program 2 times [2022-12-12 14:35:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:55,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015329630] [2022-12-12 14:35:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:55,477 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-12 14:35:55,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:55,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015329630] [2022-12-12 14:35:55,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015329630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:55,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:55,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:35:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350512730] [2022-12-12 14:35:55,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:55,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:35:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:55,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:35:55,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:35:55,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 69 [2022-12-12 14:35:55,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-12 14:35:55,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:55,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 69 [2022-12-12 14:35:55,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:55,763 INFO L130 PetriNetUnfolder]: 1740/3391 cut-off events. [2022-12-12 14:35:55,763 INFO L131 PetriNetUnfolder]: For 2089/2106 co-relation queries the response was YES. [2022-12-12 14:35:55,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11012 conditions, 3391 events. 1740/3391 cut-off events. For 2089/2106 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24072 event pairs, 136 based on Foata normal form. 449/2548 useless extension candidates. Maximal degree in co-relation 10988. Up to 1567 conditions per place. [2022-12-12 14:35:55,776 INFO L137 encePairwiseOnDemand]: 58/69 looper letters, 32 selfloop transitions, 28 changer transitions 18/85 dead transitions. [2022-12-12 14:35:55,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 586 flow [2022-12-12 14:35:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:35:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:35:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-12-12 14:35:55,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33043478260869563 [2022-12-12 14:35:55,779 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 328 flow. Second operand 5 states and 114 transitions. [2022-12-12 14:35:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 586 flow [2022-12-12 14:35:55,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 571 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-12 14:35:55,783 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 314 flow [2022-12-12 14:35:55,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2022-12-12 14:35:55,784 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -14 predicate places. [2022-12-12 14:35:55,784 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 314 flow [2022-12-12 14:35:55,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-12 14:35:55,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:55,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:55,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:35:55,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1274014489, now seen corresponding path program 1 times [2022-12-12 14:35:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411721812] [2022-12-12 14:35:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:56,581 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-12 14:35:56,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:56,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411721812] [2022-12-12 14:35:56,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411721812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:56,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:56,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:35:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092176783] [2022-12-12 14:35:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:35:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:35:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:35:56,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 69 [2022-12-12 14:35:56,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-12 14:35:56,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:56,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 69 [2022-12-12 14:35:56,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:56,778 INFO L130 PetriNetUnfolder]: 541/1139 cut-off events. [2022-12-12 14:35:56,778 INFO L131 PetriNetUnfolder]: For 1645/1807 co-relation queries the response was YES. [2022-12-12 14:35:56,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4423 conditions, 1139 events. 541/1139 cut-off events. For 1645/1807 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6548 event pairs, 70 based on Foata normal form. 75/968 useless extension candidates. Maximal degree in co-relation 4399. Up to 577 conditions per place. [2022-12-12 14:35:56,783 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 39 selfloop transitions, 4 changer transitions 40/99 dead transitions. [2022-12-12 14:35:56,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 764 flow [2022-12-12 14:35:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:35:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:35:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-12 14:35:56,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2898550724637681 [2022-12-12 14:35:56,784 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 314 flow. Second operand 7 states and 140 transitions. [2022-12-12 14:35:56,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 764 flow [2022-12-12 14:35:56,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 596 flow, removed 38 selfloop flow, removed 12 redundant places. [2022-12-12 14:35:56,792 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 243 flow [2022-12-12 14:35:56,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-12 14:35:56,793 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -19 predicate places. [2022-12-12 14:35:56,793 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 243 flow [2022-12-12 14:35:56,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-12 14:35:56,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:56,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:56,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:35:56,793 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 503390529, now seen corresponding path program 2 times [2022-12-12 14:35:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917241088] [2022-12-12 14:35:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:57,318 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-12 14:35:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917241088] [2022-12-12 14:35:57,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917241088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:57,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:57,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:35:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131613578] [2022-12-12 14:35:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:57,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:35:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:35:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:35:57,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 69 [2022-12-12 14:35:57,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-12 14:35:57,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:57,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 69 [2022-12-12 14:35:57,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:57,494 INFO L130 PetriNetUnfolder]: 502/1065 cut-off events. [2022-12-12 14:35:57,494 INFO L131 PetriNetUnfolder]: For 912/975 co-relation queries the response was YES. [2022-12-12 14:35:57,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3546 conditions, 1065 events. 502/1065 cut-off events. For 912/975 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6541 event pairs, 9 based on Foata normal form. 69/891 useless extension candidates. Maximal degree in co-relation 3526. Up to 400 conditions per place. [2022-12-12 14:35:57,498 INFO L137 encePairwiseOnDemand]: 62/69 looper letters, 66 selfloop transitions, 5 changer transitions 28/113 dead transitions. [2022-12-12 14:35:57,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 743 flow [2022-12-12 14:35:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:35:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:35:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-12-12 14:35:57,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2898550724637681 [2022-12-12 14:35:57,499 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 243 flow. Second operand 7 states and 140 transitions. [2022-12-12 14:35:57,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 743 flow [2022-12-12 14:35:57,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 726 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-12 14:35:57,505 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 257 flow [2022-12-12 14:35:57,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2022-12-12 14:35:57,506 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-12 14:35:57,506 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 257 flow [2022-12-12 14:35:57,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-12 14:35:57,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:57,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:57,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:35:57,506 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash 430982145, now seen corresponding path program 3 times [2022-12-12 14:35:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:57,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007302266] [2022-12-12 14:35:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:35:57,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:35:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:35:57,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:35:57,579 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:35:57,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:35:57,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:35:57,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:35:57,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:35:57,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:35:57,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:35:57,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:35:57,582 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:57,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:35:57,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:35:57,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:35:57 BasicIcfg [2022-12-12 14:35:57,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:35:57,660 INFO L158 Benchmark]: Toolchain (without parser) took 13960.36ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 174.1MB in the beginning and 453.3MB in the end (delta: -279.2MB). Peak memory consumption was 644.9MB. Max. memory is 8.0GB. [2022-12-12 14:35:57,660 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:35:57,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.38ms. Allocated memory is still 199.2MB. Free memory was 174.1MB in the beginning and 146.6MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 14:35:57,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.84ms. Allocated memory is still 199.2MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:35:57,661 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 199.2MB. Free memory was 144.0MB in the beginning and 142.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:35:57,661 INFO L158 Benchmark]: RCFGBuilder took 537.56ms. Allocated memory is still 199.2MB. Free memory was 142.4MB in the beginning and 107.8MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-12 14:35:57,661 INFO L158 Benchmark]: TraceAbstraction took 12870.03ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 106.8MB in the beginning and 453.3MB in the end (delta: -346.5MB). Peak memory consumption was 577.8MB. Max. memory is 8.0GB. [2022-12-12 14:35:57,662 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.38ms. Allocated memory is still 199.2MB. Free memory was 174.1MB in the beginning and 146.6MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.84ms. Allocated memory is still 199.2MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 199.2MB. Free memory was 144.0MB in the beginning and 142.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 537.56ms. Allocated memory is still 199.2MB. Free memory was 142.4MB in the beginning and 107.8MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12870.03ms. Allocated memory was 199.2MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 106.8MB in the beginning and 453.3MB in the end (delta: -346.5MB). Peak memory consumption was 577.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 117 PlacesBefore, 78 PlacesAfterwards, 109 TransitionsBefore, 69 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 4320, independent unconditional: 0, dependent: 133, dependent conditional: 133, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4453, independent: 4320, independent conditional: 0, independent unconditional: 4320, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2217, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2217, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 220, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4453, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 2217, unknown conditional: 0, unknown unconditional: 2217] , Statistics on independence cache: Total cache size (in pairs): 4387, Positive cache size: 4345, Positive conditional cache size: 0, Positive unconditional cache size: 4345, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1003 IncrementalHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 17 mSDtfsCounter, 1003 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 2.5s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 14:35:57,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...