/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_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:35:45,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:35:45,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:35:45,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:35:45,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:35:45,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:35:45,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:35:45,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:35:45,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:35:45,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:35:45,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:35:45,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:35:45,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:35:45,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:35:45,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:35:45,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:35:45,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:35:45,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:35:45,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:35:45,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:35:45,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:35:45,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:35:45,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:35:45,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:35:45,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:35:45,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:35:45,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:35:45,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:35:45,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:35:45,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:35:45,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:35:45,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:35:45,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:35:45,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:35:45,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:35:45,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:35:45,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:35:45,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:35:45,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:35:45,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:35:45,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:35:45,323 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:45,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:35:45,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:35:45,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:35:45,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:35:45,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:35:45,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:35:45,363 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:35:45,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:35:45,363 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:35:45,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:35:45,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:35:45,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:35:45,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:35:45,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:35:45,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:35:45,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:35:45,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:35:45,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:35:45,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:35:45,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:35:45,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:35:45,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:35:45,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:35:45,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:35:45,367 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:45,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:35:45,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:35:45,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:35:45,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:35:45,710 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:35:45,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-12 14:35:46,845 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:35:47,117 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:35:47,117 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2022-12-12 14:35:47,130 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5979d6d2a/eb4a0d6e32a64c2f962427071157a7b9/FLAG8f19ae075 [2022-12-12 14:35:47,146 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5979d6d2a/eb4a0d6e32a64c2f962427071157a7b9 [2022-12-12 14:35:47,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:35:47,152 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:35:47,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:35:47,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:35:47,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:35:47,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:35:47" (1/1) ... [2022-12-12 14:35:47,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9213c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:47, skipping insertion in model container [2022-12-12 14:35:47,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:35:47" (1/1) ... [2022-12-12 14:35:47,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:35:47,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:35:47,395 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_tso.oepc.i[949,962] [2022-12-12 14:35:47,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:35:47,634 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:35:47,646 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_tso.oepc.i[949,962] [2022-12-12 14:35:47,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:35:47,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:35:47,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:35:47,744 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:35:47,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:47 WrapperNode [2022-12-12 14:35:47,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:35:47,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:35:47,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:35:47,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:35:47,754 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:47" (1/1) ... [2022-12-12 14:35:47,786 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:47" (1/1) ... [2022-12-12 14:35:47,808 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-12 14:35:47,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:35:47,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:35:47,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:35:47,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:35:47,817 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:47" (1/1) ... [2022-12-12 14:35:47,817 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:47" (1/1) ... [2022-12-12 14:35:47,820 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:47" (1/1) ... [2022-12-12 14:35:47,821 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:47" (1/1) ... [2022-12-12 14:35:47,842 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:47" (1/1) ... [2022-12-12 14:35:47,844 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:47" (1/1) ... [2022-12-12 14:35:47,845 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:47" (1/1) ... [2022-12-12 14:35:47,847 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:47" (1/1) ... [2022-12-12 14:35:47,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:35:47,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:35:47,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:35:47,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:35:47,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:47" (1/1) ... [2022-12-12 14:35:47,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:35:47,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:35:47,900 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:47,909 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:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:35:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:35:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:35:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:35:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:35:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:35:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:35:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:35:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:35:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:35:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:35:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:35:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:35:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:35:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:35:47,933 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:48,046 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:35:48,048 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:35:48,398 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:35:48,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:35:48,524 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:35:48,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:35:48 BoogieIcfgContainer [2022-12-12 14:35:48,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:35:48,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:35:48,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:35:48,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:35:48,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:35:47" (1/3) ... [2022-12-12 14:35:48,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6421bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:35:48, skipping insertion in model container [2022-12-12 14:35:48,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:35:47" (2/3) ... [2022-12-12 14:35:48,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6421bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:35:48, skipping insertion in model container [2022-12-12 14:35:48,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:35:48" (3/3) ... [2022-12-12 14:35:48,535 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-12-12 14:35:48,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:35:48,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:35:48,553 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:35:48,615 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:35:48,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 14:35:48,742 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 14:35:48,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:35:48,749 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:48,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 14:35:48,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:48,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:35:48,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:48,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:48,828 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 14:35:48,828 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:35:48,830 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:48,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 14:35:48,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 2082 [2022-12-12 14:35:54,374 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-12 14:35:54,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:35:54,400 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;@41f44844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:35:54,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:35:54,409 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-12 14:35:54,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:35:54,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:54,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:35:54,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 478430068, now seen corresponding path program 1 times [2022-12-12 14:35:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:54,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853984159] [2022-12-12 14:35:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:54,901 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,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:54,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853984159] [2022-12-12 14:35:54,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853984159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:54,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:54,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:35:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757510404] [2022-12-12 14:35:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:54,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:54,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:54,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 14:35:54,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 137 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:54,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:54,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 14:35:54,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:56,851 INFO L130 PetriNetUnfolder]: 10824/17312 cut-off events. [2022-12-12 14:35:56,851 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 14:35:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32739 conditions, 17312 events. 10824/17312 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 132186 event pairs, 1448 based on Foata normal form. 0/10609 useless extension candidates. Maximal degree in co-relation 32728. Up to 12997 conditions per place. [2022-12-12 14:35:56,909 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 36 selfloop transitions, 2 changer transitions 51/100 dead transitions. [2022-12-12 14:35:56,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 388 flow [2022-12-12 14:35:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-12-12 14:35:56,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2022-12-12 14:35:56,921 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 137 flow. Second operand 3 states and 131 transitions. [2022-12-12 14:35:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 388 flow [2022-12-12 14:35:56,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:35:56,926 INFO L231 Difference]: Finished difference. Result has 69 places, 34 transitions, 78 flow [2022-12-12 14:35:56,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2022-12-12 14:35:56,931 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2022-12-12 14:35:56,931 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 34 transitions, 78 flow [2022-12-12 14:35:56,931 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:56,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:56,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:56,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:35:56,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash -211075259, now seen corresponding path program 1 times [2022-12-12 14:35:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:56,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086829460] [2022-12-12 14:35:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:57,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:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086829460] [2022-12-12 14:35:57,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086829460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:57,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:57,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:35:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52582389] [2022-12-12 14:35:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:57,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:57,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:57,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:57,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2022-12-12 14:35:57,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:57,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2022-12-12 14:35:57,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:57,456 INFO L130 PetriNetUnfolder]: 1439/2316 cut-off events. [2022-12-12 14:35:57,456 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-12 14:35:57,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 2316 events. 1439/2316 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12158 event pairs, 599 based on Foata normal form. 75/1940 useless extension candidates. Maximal degree in co-relation 4632. Up to 1316 conditions per place. [2022-12-12 14:35:57,469 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 30 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2022-12-12 14:35:57,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 166 flow [2022-12-12 14:35:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-12 14:35:57,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-12 14:35:57,471 INFO L175 Difference]: Start difference. First operand has 69 places, 34 transitions, 78 flow. Second operand 3 states and 70 transitions. [2022-12-12 14:35:57,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 166 flow [2022-12-12 14:35:57,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:35:57,473 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 80 flow [2022-12-12 14:35:57,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-12 14:35:57,474 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -28 predicate places. [2022-12-12 14:35:57,474 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 80 flow [2022-12-12 14:35:57,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:57,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:57,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:35:57,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -978384589, now seen corresponding path program 1 times [2022-12-12 14:35:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:57,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855094515] [2022-12-12 14:35:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:57,878 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,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:57,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855094515] [2022-12-12 14:35:57,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855094515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:57,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:57,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:35:57,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754016678] [2022-12-12 14:35:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:57,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:35:57,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:35:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:35:57,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:35:57,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:57,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:35:57,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:58,228 INFO L130 PetriNetUnfolder]: 1541/2522 cut-off events. [2022-12-12 14:35:58,229 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-12 14:35:58,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 2522 events. 1541/2522 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13546 event pairs, 721 based on Foata normal form. 2/2135 useless extension candidates. Maximal degree in co-relation 5160. Up to 2226 conditions per place. [2022-12-12 14:35:58,252 INFO L137 encePairwiseOnDemand]: 59/64 looper letters, 31 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-12 14:35:58,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 181 flow [2022-12-12 14:35:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:35:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:35:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-12 14:35:58,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.359375 [2022-12-12 14:35:58,256 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 80 flow. Second operand 3 states and 69 transitions. [2022-12-12 14:35:58,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 181 flow [2022-12-12 14:35:58,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:35:58,258 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 102 flow [2022-12-12 14:35:58,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-12 14:35:58,262 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -28 predicate places. [2022-12-12 14:35:58,266 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 102 flow [2022-12-12 14:35:58,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:58,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:58,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:58,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:35:58,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -265151412, now seen corresponding path program 1 times [2022-12-12 14:35:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:58,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679842790] [2022-12-12 14:35:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:35:58,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:58,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679842790] [2022-12-12 14:35:58,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679842790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:58,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:58,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443794083] [2022-12-12 14:35:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:58,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:35:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:35:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:35:58,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:35:58,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:58,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:58,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:35:58,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:58,932 INFO L130 PetriNetUnfolder]: 1561/2570 cut-off events. [2022-12-12 14:35:58,932 INFO L131 PetriNetUnfolder]: For 527/551 co-relation queries the response was YES. [2022-12-12 14:35:58,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 2570 events. 1561/2570 cut-off events. For 527/551 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13930 event pairs, 710 based on Foata normal form. 29/2209 useless extension candidates. Maximal degree in co-relation 5669. Up to 2105 conditions per place. [2022-12-12 14:35:58,950 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 43 selfloop transitions, 8 changer transitions 0/61 dead transitions. [2022-12-12 14:35:58,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 270 flow [2022-12-12 14:35:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 14:35:58,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2022-12-12 14:35:58,952 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions. [2022-12-12 14:35:58,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 270 flow [2022-12-12 14:35:58,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:35:58,957 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 154 flow [2022-12-12 14:35:58,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-12 14:35:58,959 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -24 predicate places. [2022-12-12 14:35:58,959 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 154 flow [2022-12-12 14:35:58,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:58,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:58,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:58,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:35:58,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 923516863, now seen corresponding path program 1 times [2022-12-12 14:35:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:58,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711396102] [2022-12-12 14:35:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 14:35:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:59,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711396102] [2022-12-12 14:35:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711396102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:59,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566647600] [2022-12-12 14:35:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:59,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:35:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:35:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:35:59,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:35:59,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:59,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:59,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:35:59,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:35:59,542 INFO L130 PetriNetUnfolder]: 1588/2677 cut-off events. [2022-12-12 14:35:59,543 INFO L131 PetriNetUnfolder]: For 1800/1866 co-relation queries the response was YES. [2022-12-12 14:35:59,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6696 conditions, 2677 events. 1588/2677 cut-off events. For 1800/1866 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14874 event pairs, 313 based on Foata normal form. 34/2318 useless extension candidates. Maximal degree in co-relation 6681. Up to 1977 conditions per place. [2022-12-12 14:35:59,559 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 48 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2022-12-12 14:35:59,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 352 flow [2022-12-12 14:35:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:35:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:35:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-12 14:35:59,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 14:35:59,561 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 154 flow. Second operand 4 states and 96 transitions. [2022-12-12 14:35:59,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 352 flow [2022-12-12 14:35:59,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 348 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 14:35:59,567 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 200 flow [2022-12-12 14:35:59,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-12 14:35:59,569 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2022-12-12 14:35:59,569 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 200 flow [2022-12-12 14:35:59,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:59,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:35:59,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:35:59,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:35:59,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:35:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:35:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 844087423, now seen corresponding path program 2 times [2022-12-12 14:35:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:35:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003047913] [2022-12-12 14:35:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:35:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:35:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:35:59,859 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:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:35:59,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003047913] [2022-12-12 14:35:59,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003047913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:35:59,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:35:59,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:35:59,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840999203] [2022-12-12 14:35:59,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:35:59,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:35:59,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:35:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:35:59,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:35:59,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:35:59,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:59,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:35:59,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:35:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:00,208 INFO L130 PetriNetUnfolder]: 1548/2591 cut-off events. [2022-12-12 14:36:00,208 INFO L131 PetriNetUnfolder]: For 3047/3116 co-relation queries the response was YES. [2022-12-12 14:36:00,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 2591 events. 1548/2591 cut-off events. For 3047/3116 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14371 event pairs, 333 based on Foata normal form. 55/2261 useless extension candidates. Maximal degree in co-relation 7128. Up to 1961 conditions per place. [2022-12-12 14:36:00,223 INFO L137 encePairwiseOnDemand]: 57/64 looper letters, 47 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2022-12-12 14:36:00,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 376 flow [2022-12-12 14:36:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:36:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:36:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 14:36:00,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2022-12-12 14:36:00,225 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 200 flow. Second operand 4 states and 95 transitions. [2022-12-12 14:36:00,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 376 flow [2022-12-12 14:36:00,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 363 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-12 14:36:00,229 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 218 flow [2022-12-12 14:36:00,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-12 14:36:00,230 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2022-12-12 14:36:00,230 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 218 flow [2022-12-12 14:36:00,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:36:00,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:00,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:00,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:36:00,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1435748544, now seen corresponding path program 1 times [2022-12-12 14:36:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:00,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895981223] [2022-12-12 14:36:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:00,492 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:36:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:00,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895981223] [2022-12-12 14:36:00,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895981223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:00,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:00,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:36:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766271374] [2022-12-12 14:36:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:00,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:36:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:00,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:36:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:36:00,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:36:00,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:36:00,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:00,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:36:00,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:00,875 INFO L130 PetriNetUnfolder]: 1597/2663 cut-off events. [2022-12-12 14:36:00,876 INFO L131 PetriNetUnfolder]: For 4007/4076 co-relation queries the response was YES. [2022-12-12 14:36:00,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7584 conditions, 2663 events. 1597/2663 cut-off events. For 4007/4076 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14756 event pairs, 320 based on Foata normal form. 43/2318 useless extension candidates. Maximal degree in co-relation 7564. Up to 1990 conditions per place. [2022-12-12 14:36:00,893 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 54 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2022-12-12 14:36:00,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 453 flow [2022-12-12 14:36:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:36:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:36:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-12 14:36:00,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.365625 [2022-12-12 14:36:00,895 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 218 flow. Second operand 5 states and 117 transitions. [2022-12-12 14:36:00,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 453 flow [2022-12-12 14:36:00,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 431 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 14:36:00,903 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 259 flow [2022-12-12 14:36:00,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2022-12-12 14:36:00,904 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2022-12-12 14:36:00,904 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 259 flow [2022-12-12 14:36:00,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:36:00,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:00,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:36:00,905 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:00,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1381254264, now seen corresponding path program 2 times [2022-12-12 14:36:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:00,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409645044] [2022-12-12 14:36:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:01,281 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:36:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409645044] [2022-12-12 14:36:01,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409645044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:01,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:01,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:36:01,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696608506] [2022-12-12 14:36:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:01,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:36:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:36:01,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:36:01,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:36:01,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:36:01,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:01,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:36:01,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:01,668 INFO L130 PetriNetUnfolder]: 1608/2683 cut-off events. [2022-12-12 14:36:01,668 INFO L131 PetriNetUnfolder]: For 4810/4881 co-relation queries the response was YES. [2022-12-12 14:36:01,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 2683 events. 1608/2683 cut-off events. For 4810/4881 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14888 event pairs, 319 based on Foata normal form. 43/2337 useless extension candidates. Maximal degree in co-relation 8237. Up to 1997 conditions per place. [2022-12-12 14:36:01,694 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 55 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2022-12-12 14:36:01,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 508 flow [2022-12-12 14:36:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:36:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:36:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-12 14:36:01,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.365625 [2022-12-12 14:36:01,696 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 259 flow. Second operand 5 states and 117 transitions. [2022-12-12 14:36:01,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 508 flow [2022-12-12 14:36:01,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 473 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-12 14:36:01,703 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 293 flow [2022-12-12 14:36:01,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-12-12 14:36:01,704 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2022-12-12 14:36:01,704 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 293 flow [2022-12-12 14:36:01,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:36:01,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:01,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:01,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:36:01,705 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 396906112, now seen corresponding path program 3 times [2022-12-12 14:36:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:01,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137972606] [2022-12-12 14:36:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:02,028 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:36:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137972606] [2022-12-12 14:36:02,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137972606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:02,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:02,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:36:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752185881] [2022-12-12 14:36:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:02,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:36:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:36:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:36:02,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:36:02,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:36:02,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:02,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:36:02,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:02,395 INFO L130 PetriNetUnfolder]: 1753/2931 cut-off events. [2022-12-12 14:36:02,395 INFO L131 PetriNetUnfolder]: For 6920/6991 co-relation queries the response was YES. [2022-12-12 14:36:02,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9486 conditions, 2931 events. 1753/2931 cut-off events. For 6920/6991 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16925 event pairs, 303 based on Foata normal form. 55/2565 useless extension candidates. Maximal degree in co-relation 9464. Up to 1862 conditions per place. [2022-12-12 14:36:02,417 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 57 selfloop transitions, 21 changer transitions 0/88 dead transitions. [2022-12-12 14:36:02,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 578 flow [2022-12-12 14:36:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:36:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:36:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-12 14:36:02,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.378125 [2022-12-12 14:36:02,419 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 293 flow. Second operand 5 states and 121 transitions. [2022-12-12 14:36:02,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 578 flow [2022-12-12 14:36:02,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 543 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-12 14:36:02,430 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 351 flow [2022-12-12 14:36:02,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2022-12-12 14:36:02,431 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2022-12-12 14:36:02,431 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 351 flow [2022-12-12 14:36:02,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:36:02,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:02,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:02,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:36:02,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1407536885, now seen corresponding path program 1 times [2022-12-12 14:36:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:02,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594887604] [2022-12-12 14:36:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:02,758 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:36:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594887604] [2022-12-12 14:36:02,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594887604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:02,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:02,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:36:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589827564] [2022-12-12 14:36:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:02,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:36:02,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:02,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:36:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:36:02,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:36:02,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:36:02,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:02,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:36:02,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:03,485 INFO L130 PetriNetUnfolder]: 3824/5943 cut-off events. [2022-12-12 14:36:03,486 INFO L131 PetriNetUnfolder]: For 19102/19102 co-relation queries the response was YES. [2022-12-12 14:36:03,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20116 conditions, 5943 events. 3824/5943 cut-off events. For 19102/19102 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 33587 event pairs, 348 based on Foata normal form. 114/5164 useless extension candidates. Maximal degree in co-relation 20093. Up to 2916 conditions per place. [2022-12-12 14:36:03,523 INFO L137 encePairwiseOnDemand]: 56/64 looper letters, 91 selfloop transitions, 15 changer transitions 16/130 dead transitions. [2022-12-12 14:36:03,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 130 transitions, 1098 flow [2022-12-12 14:36:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:36:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:36:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-12-12 14:36:03,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3255208333333333 [2022-12-12 14:36:03,525 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 351 flow. Second operand 6 states and 125 transitions. [2022-12-12 14:36:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 130 transitions, 1098 flow [2022-12-12 14:36:03,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 130 transitions, 996 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-12 14:36:03,545 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 472 flow [2022-12-12 14:36:03,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2022-12-12 14:36:03,546 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2022-12-12 14:36:03,546 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 472 flow [2022-12-12 14:36:03,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:36:03,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:03,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:03,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:36:03,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -919032263, now seen corresponding path program 2 times [2022-12-12 14:36:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276568733] [2022-12-12 14:36:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:03,653 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:36:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:03,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276568733] [2022-12-12 14:36:03,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276568733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:03,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:03,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:36:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434998505] [2022-12-12 14:36:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:03,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:36:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:36:03,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:36:03,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:36:03,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:36:03,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:03,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:36:03,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:04,217 INFO L130 PetriNetUnfolder]: 3414/5418 cut-off events. [2022-12-12 14:36:04,217 INFO L131 PetriNetUnfolder]: For 14436/14465 co-relation queries the response was YES. [2022-12-12 14:36:04,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18469 conditions, 5418 events. 3414/5418 cut-off events. For 14436/14465 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32288 event pairs, 1030 based on Foata normal form. 98/3885 useless extension candidates. Maximal degree in co-relation 18442. Up to 5029 conditions per place. [2022-12-12 14:36:04,251 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 67 selfloop transitions, 10 changer transitions 3/92 dead transitions. [2022-12-12 14:36:04,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 753 flow [2022-12-12 14:36:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:36:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:36:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-12 14:36:04,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3802083333333333 [2022-12-12 14:36:04,253 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 472 flow. Second operand 3 states and 73 transitions. [2022-12-12 14:36:04,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 753 flow [2022-12-12 14:36:04,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 92 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-12 14:36:04,273 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 486 flow [2022-12-12 14:36:04,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2022-12-12 14:36:04,274 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2022-12-12 14:36:04,275 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 486 flow [2022-12-12 14:36:04,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 14:36:04,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:04,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:04,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:36:04,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1942853612, now seen corresponding path program 1 times [2022-12-12 14:36:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:04,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075680791] [2022-12-12 14:36:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:04,390 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:36:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:04,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075680791] [2022-12-12 14:36:04,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075680791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:04,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:04,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:36:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185056591] [2022-12-12 14:36:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:04,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:36:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:04,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:36:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:36:04,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:36:04,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:36:04,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:04,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:36:04,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:04,783 INFO L130 PetriNetUnfolder]: 1668/3033 cut-off events. [2022-12-12 14:36:04,784 INFO L131 PetriNetUnfolder]: For 7710/7727 co-relation queries the response was YES. [2022-12-12 14:36:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12130 conditions, 3033 events. 1668/3033 cut-off events. For 7710/7727 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 19362 event pairs, 202 based on Foata normal form. 244/2354 useless extension candidates. Maximal degree in co-relation 12100. Up to 2017 conditions per place. [2022-12-12 14:36:04,802 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 72 selfloop transitions, 19 changer transitions 4/107 dead transitions. [2022-12-12 14:36:04,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 903 flow [2022-12-12 14:36:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:36:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:36:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-12 14:36:04,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-12 14:36:04,804 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 486 flow. Second operand 4 states and 100 transitions. [2022-12-12 14:36:04,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 903 flow [2022-12-12 14:36:04,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 107 transitions, 859 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-12 14:36:04,819 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 548 flow [2022-12-12 14:36:04,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=548, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2022-12-12 14:36:04,819 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2022-12-12 14:36:04,820 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 548 flow [2022-12-12 14:36:04,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:36:04,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:04,820 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:36:04,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:36:04,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1242933345, now seen corresponding path program 1 times [2022-12-12 14:36:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:04,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089129449] [2022-12-12 14:36:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:04,959 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:36:04,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:04,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089129449] [2022-12-12 14:36:04,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089129449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:04,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:04,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:36:04,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502493557] [2022-12-12 14:36:04,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:04,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:36:04,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:04,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:36:04,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:36:04,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2022-12-12 14:36:04,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:36:04,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:04,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2022-12-12 14:36:04,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:05,190 INFO L130 PetriNetUnfolder]: 984/1845 cut-off events. [2022-12-12 14:36:05,191 INFO L131 PetriNetUnfolder]: For 3942/3959 co-relation queries the response was YES. [2022-12-12 14:36:05,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8017 conditions, 1845 events. 984/1845 cut-off events. For 3942/3959 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10912 event pairs, 67 based on Foata normal form. 202/1412 useless extension candidates. Maximal degree in co-relation 7986. Up to 916 conditions per place. [2022-12-12 14:36:05,204 INFO L137 encePairwiseOnDemand]: 53/64 looper letters, 47 selfloop transitions, 28 changer transitions 22/107 dead transitions. [2022-12-12 14:36:05,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 935 flow [2022-12-12 14:36:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:36:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:36:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-12 14:36:05,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.340625 [2022-12-12 14:36:05,206 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 548 flow. Second operand 5 states and 109 transitions. [2022-12-12 14:36:05,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 935 flow [2022-12-12 14:36:05,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 850 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-12 14:36:05,217 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 429 flow [2022-12-12 14:36:05,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2022-12-12 14:36:05,217 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2022-12-12 14:36:05,217 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 429 flow [2022-12-12 14:36:05,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:36:05,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:05,218 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:36:05,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 14:36:05,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1197174520, now seen corresponding path program 1 times [2022-12-12 14:36:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:05,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500869605] [2022-12-12 14:36:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:36:05,359 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:36:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:36:05,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500869605] [2022-12-12 14:36:05,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500869605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:36:05,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:36:05,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:36:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031798193] [2022-12-12 14:36:05,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:36:05,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:36:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:36:05,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:36:05,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:36:05,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 64 [2022-12-12 14:36:05,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:36:05,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:36:05,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 64 [2022-12-12 14:36:05,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:36:05,617 INFO L130 PetriNetUnfolder]: 760/1561 cut-off events. [2022-12-12 14:36:05,617 INFO L131 PetriNetUnfolder]: For 3289/3474 co-relation queries the response was YES. [2022-12-12 14:36:05,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6427 conditions, 1561 events. 760/1561 cut-off events. For 3289/3474 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9473 event pairs, 134 based on Foata normal form. 128/1378 useless extension candidates. Maximal degree in co-relation 6397. Up to 779 conditions per place. [2022-12-12 14:36:05,626 INFO L137 encePairwiseOnDemand]: 61/64 looper letters, 51 selfloop transitions, 1 changer transitions 48/115 dead transitions. [2022-12-12 14:36:05,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 115 transitions, 985 flow [2022-12-12 14:36:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:36:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:36:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-12 14:36:05,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2022-12-12 14:36:05,628 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 429 flow. Second operand 4 states and 94 transitions. [2022-12-12 14:36:05,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 115 transitions, 985 flow [2022-12-12 14:36:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 115 transitions, 807 flow, removed 43 selfloop flow, removed 9 redundant places. [2022-12-12 14:36:05,647 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 284 flow [2022-12-12 14:36:05,647 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2022-12-12 14:36:05,648 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2022-12-12 14:36:05,648 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 284 flow [2022-12-12 14:36:05,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:36:05,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:36:05,649 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:36:05,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 14:36:05,649 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:36:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:36:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 931456940, now seen corresponding path program 1 times [2022-12-12 14:36:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:36:05,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335338706] [2022-12-12 14:36:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:36:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:36:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:36:05,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:36:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:36:05,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:36:05,779 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:36:05,780 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:36:05,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:36:05,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:36:05,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:36:05,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:36:05,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:36:05,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 14:36:05,783 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:36:05,788 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:36:05,788 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:36:05,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:36:05 BasicIcfg [2022-12-12 14:36:05,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:36:05,870 INFO L158 Benchmark]: Toolchain (without parser) took 18718.55ms. Allocated memory was 199.2MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 174.5MB in the beginning and 1.0GB in the end (delta: -855.5MB). Peak memory consumption was 144.3MB. Max. memory is 8.0GB. [2022-12-12 14:36:05,872 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory was 176.4MB in the beginning and 176.4MB in the end (delta: 87.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:36:05,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.91ms. Allocated memory is still 199.2MB. Free memory was 174.5MB in the beginning and 147.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 14:36:05,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.42ms. Allocated memory is still 199.2MB. Free memory was 147.3MB in the beginning and 144.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 14:36:05,873 INFO L158 Benchmark]: Boogie Preprocessor took 40.12ms. Allocated memory is still 199.2MB. Free memory was 144.7MB in the beginning and 143.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:36:05,873 INFO L158 Benchmark]: RCFGBuilder took 676.78ms. Allocated memory is still 199.2MB. Free memory was 143.1MB in the beginning and 108.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 14:36:05,873 INFO L158 Benchmark]: TraceAbstraction took 17340.55ms. Allocated memory was 199.2MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 106.4MB in the beginning and 1.0GB in the end (delta: -923.6MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-12-12 14:36:05,874 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.16ms. Allocated memory is still 199.2MB. Free memory was 176.4MB in the beginning and 176.4MB in the end (delta: 87.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 591.91ms. Allocated memory is still 199.2MB. Free memory was 174.5MB in the beginning and 147.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.42ms. Allocated memory is still 199.2MB. Free memory was 147.3MB in the beginning and 144.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.12ms. Allocated memory is still 199.2MB. Free memory was 144.7MB in the beginning and 143.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 676.78ms. Allocated memory is still 199.2MB. Free memory was 143.1MB in the beginning and 108.0MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17340.55ms. Allocated memory was 199.2MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 106.4MB in the beginning and 1.0GB in the end (delta: -923.6MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 117 PlacesBefore, 72 PlacesAfterwards, 109 TransitionsBefore, 64 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 3273, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3451, independent: 3273, independent conditional: 0, independent unconditional: 3273, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1992, independent: 1932, independent conditional: 0, independent unconditional: 1932, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1992, independent: 1850, independent conditional: 0, independent unconditional: 1850, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 356, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3451, independent: 1341, independent conditional: 0, independent unconditional: 1341, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1992, unknown conditional: 0, unknown unconditional: 1992] , Statistics on independence cache: Total cache size (in pairs): 3324, Positive cache size: 3264, Positive conditional cache size: 0, Positive unconditional cache size: 3264, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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 main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-3, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-2, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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: 831]: 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: 833]: 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: 835]: 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: 17.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1198 IncrementalHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 14 mSDtfsCounter, 1198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=548occurred in iteration=12, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:36:05,890 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...