/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 11:25:08,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 11:25:08,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 11:25:08,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 11:25:08,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 11:25:08,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 11:25:08,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 11:25:08,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 11:25:08,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 11:25:08,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 11:25:08,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 11:25:08,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 11:25:08,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 11:25:08,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 11:25:08,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 11:25:08,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 11:25:08,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 11:25:08,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 11:25:08,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 11:25:08,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 11:25:08,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 11:25:08,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 11:25:08,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 11:25:08,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 11:25:08,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 11:25:08,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 11:25:08,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 11:25:08,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 11:25:08,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 11:25:08,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 11:25:08,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 11:25:08,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 11:25:08,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 11:25:08,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 11:25:08,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 11:25:08,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 11:25:08,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 11:25:08,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 11:25:08,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 11:25:08,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 11:25:08,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 11:25:08,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 11:25:08,480 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 11:25:08,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 11:25:08,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 11:25:08,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 11:25:08,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 11:25:08,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 11:25:08,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 11:25:08,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 11:25:08,482 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 11:25:08,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 11:25:08,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 11:25:08,484 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 11:25:08,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 11:25:08,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 11:25:08,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 11:25:08,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 11:25:08,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 11:25:08,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 11:25:08,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 11:25:08,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 11:25:08,486 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 11:25:08,487 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-20 11:25:08,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 11:25:08,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 11:25:08,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 11:25:08,697 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 11:25:08,698 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 11:25:08,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-05-20 11:25:08,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe217e155/4bb444ef8b2e4910a9025b7d851f215a/FLAG75fcd4ae9 [2023-05-20 11:25:09,065 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 11:25:09,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-05-20 11:25:09,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe217e155/4bb444ef8b2e4910a9025b7d851f215a/FLAG75fcd4ae9 [2023-05-20 11:25:09,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe217e155/4bb444ef8b2e4910a9025b7d851f215a [2023-05-20 11:25:09,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 11:25:09,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 11:25:09,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 11:25:09,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 11:25:09,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 11:25:09,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9eb715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09, skipping insertion in model container [2023-05-20 11:25:09,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 11:25:09,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 11:25:09,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-05-20 11:25:09,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 11:25:09,726 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 11:25:09,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-05-20 11:25:09,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 11:25:09,767 INFO L208 MainTranslator]: Completed translation [2023-05-20 11:25:09,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09 WrapperNode [2023-05-20 11:25:09,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 11:25:09,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 11:25:09,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 11:25:09,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 11:25:09,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,794 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-05-20 11:25:09,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 11:25:09,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 11:25:09,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 11:25:09,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 11:25:09,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 11:25:09,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 11:25:09,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 11:25:09,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 11:25:09,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (1/1) ... [2023-05-20 11:25:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 11:25:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:09,837 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) [2023-05-20 11:25:09,846 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 [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 11:25:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 11:25:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 11:25:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 11:25:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 11:25:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 11:25:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 11:25:09,865 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 11:25:09,943 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 11:25:09,946 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 11:25:10,143 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 11:25:10,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 11:25:10,213 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-20 11:25:10,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 11:25:10 BoogieIcfgContainer [2023-05-20 11:25:10,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 11:25:10,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 11:25:10,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 11:25:10,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 11:25:10,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 11:25:09" (1/3) ... [2023-05-20 11:25:10,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364629f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 11:25:10, skipping insertion in model container [2023-05-20 11:25:10,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:25:09" (2/3) ... [2023-05-20 11:25:10,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364629f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 11:25:10, skipping insertion in model container [2023-05-20 11:25:10,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 11:25:10" (3/3) ... [2023-05-20 11:25:10,237 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-05-20 11:25:10,244 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 11:25:10,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 11:25:10,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 11:25:10,250 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 11:25:10,317 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 11:25:10,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 11:25:10,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 11:25:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:10,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 11:25:10,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 11:25:10,389 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 11:25:10,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 11:25:10,417 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@49695db6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 11:25:10,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 11:25:10,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 253827499, now seen corresponding path program 1 times [2023-05-20 11:25:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:10,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935024935] [2023-05-20 11:25:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:10,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935024935] [2023-05-20 11:25:10,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935024935] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 11:25:10,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 11:25:10,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 11:25:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776613580] [2023-05-20 11:25:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:25:10,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 11:25:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 11:25:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 11:25:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:10,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:10,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 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) [2023-05-20 11:25:10,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:10,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 11:25:10,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:10,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1961100044, now seen corresponding path program 1 times [2023-05-20 11:25:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:10,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718403703] [2023-05-20 11:25:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718403703] [2023-05-20 11:25:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718403703] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 11:25:11,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 11:25:11,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-20 11:25:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605909340] [2023-05-20 11:25:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:25:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 11:25:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 11:25:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-20 11:25:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:11,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:11,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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) [2023-05-20 11:25:11,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:11,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 11:25:11,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1243980486, now seen corresponding path program 1 times [2023-05-20 11:25:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:11,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096037411] [2023-05-20 11:25:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096037411] [2023-05-20 11:25:11,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096037411] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148547135] [2023-05-20 11:25:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:11,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:11,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:11,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:11,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 11:25:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:11,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 11:25:11,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:11,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:11,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148547135] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:11,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 11:25:11,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-20 11:25:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249727371] [2023-05-20 11:25:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:25:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 11:25:11,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 11:25:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 11:25:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:11,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:11,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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) [2023-05-20 11:25:11,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:11,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:11,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:12,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:12,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-20 11:25:12,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1482401504, now seen corresponding path program 1 times [2023-05-20 11:25:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:12,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002420060] [2023-05-20 11:25:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:12,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:12,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002420060] [2023-05-20 11:25:12,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002420060] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:12,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056694467] [2023-05-20 11:25:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:12,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:12,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:12,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:12,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 11:25:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:12,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 11:25:12,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:12,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:12,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056694467] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:12,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:12,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-05-20 11:25:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081954447] [2023-05-20 11:25:12,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:12,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-20 11:25:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:12,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-20 11:25:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 11:25:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:12,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:12,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 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) [2023-05-20 11:25:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:12,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:12,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-20 11:25:13,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:13,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash 394054078, now seen corresponding path program 1 times [2023-05-20 11:25:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:13,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169855467] [2023-05-20 11:25:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:13,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:13,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169855467] [2023-05-20 11:25:13,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169855467] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:13,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291845586] [2023-05-20 11:25:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:13,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:13,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:13,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:13,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 11:25:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:13,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-20 11:25:13,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:13,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 11:25:13,992 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 11:25:13,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 11:25:14,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-05-20 11:25:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:14,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:14,401 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_94 (Array Int Int))) (<= |c_thread1Thread1of1ForFork0_~tmp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_94) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_94 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_94) c_~A~0.base) c_~A~0.offset) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2023-05-20 11:25:14,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:25:14,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-05-20 11:25:14,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-05-20 11:25:14,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 11:25:14,453 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-05-20 11:25:14,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-05-20 11:25:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:14,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291845586] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:14,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:14,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 32 [2023-05-20 11:25:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583399800] [2023-05-20 11:25:14,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:14,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-20 11:25:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:14,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-20 11:25:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=825, Unknown=11, NotChecked=58, Total=992 [2023-05-20 11:25:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:14,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:14,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 32 states have internal predecessors, (173), 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) [2023-05-20 11:25:14,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:14,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:14,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:14,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:14,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:15,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:15,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:15,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1055764866, now seen corresponding path program 2 times [2023-05-20 11:25:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:15,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995645285] [2023-05-20 11:25:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995645285] [2023-05-20 11:25:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995645285] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953234111] [2023-05-20 11:25:15,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 11:25:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:15,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:15,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-20 11:25:15,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 11:25:15,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:15,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 11:25:15,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:16,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953234111] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:16,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:16,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-05-20 11:25:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777372990] [2023-05-20 11:25:16,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-05-20 11:25:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-05-20 11:25:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2023-05-20 11:25:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:16,158 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:16,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.904761904761905) internal successors, (187), 21 states have internal predecessors, (187), 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) [2023-05-20 11:25:16,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:16,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-20 11:25:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:16,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:17,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash 560340342, now seen corresponding path program 3 times [2023-05-20 11:25:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:17,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073115502] [2023-05-20 11:25:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:17,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073115502] [2023-05-20 11:25:17,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073115502] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139257755] [2023-05-20 11:25:17,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 11:25:17,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:17,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:17,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 11:25:17,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-05-20 11:25:17,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:17,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 11:25:17,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:17,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:17,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139257755] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:17,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:17,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-20 11:25:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283560676] [2023-05-20 11:25:17,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:17,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-20 11:25:17,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:17,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-20 11:25:17,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-05-20 11:25:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:17,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:17,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.791666666666667) internal successors, (187), 24 states have internal predecessors, (187), 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) [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:17,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:18,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:18,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:18,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash -486353096, now seen corresponding path program 4 times [2023-05-20 11:25:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759752699] [2023-05-20 11:25:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 11:25:18,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759752699] [2023-05-20 11:25:18,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759752699] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221427065] [2023-05-20 11:25:18,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 11:25:18,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:18,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:18,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:18,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-20 11:25:18,629 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 11:25:18,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:18,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjunts are in the unsatisfiable core [2023-05-20 11:25:18,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 11:25:18,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 11:25:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221427065] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:19,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2023-05-20 11:25:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388129703] [2023-05-20 11:25:19,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-05-20 11:25:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-05-20 11:25:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2023-05-20 11:25:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:19,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:19,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 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) [2023-05-20 11:25:19,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:19,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:19,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:19,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:19,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:19,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:19,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:19,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:19,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:19,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:19,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1841859082, now seen corresponding path program 5 times [2023-05-20 11:25:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:19,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130552229] [2023-05-20 11:25:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:19,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130552229] [2023-05-20 11:25:19,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130552229] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:19,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750619707] [2023-05-20 11:25:19,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-20 11:25:19,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:19,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:19,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-20 11:25:20,011 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-05-20 11:25:20,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:20,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 12 conjunts are in the unsatisfiable core [2023-05-20 11:25:20,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-05-20 11:25:20,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-05-20 11:25:20,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750619707] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:20,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:20,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 30 [2023-05-20 11:25:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201197074] [2023-05-20 11:25:20,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-20 11:25:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:20,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-20 11:25:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2023-05-20 11:25:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:20,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:20,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.8) internal successors, (234), 30 states have internal predecessors, (234), 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) [2023-05-20 11:25:20,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:20,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:20,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:20,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:20,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:20,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:20,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:20,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:20,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:22,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:22,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-05-20 11:25:22,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 473487516, now seen corresponding path program 6 times [2023-05-20 11:25:22,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:22,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022684118] [2023-05-20 11:25:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 149 proven. 35 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-05-20 11:25:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022684118] [2023-05-20 11:25:22,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022684118] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:22,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46610964] [2023-05-20 11:25:22,806 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-05-20 11:25:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:22,807 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:22,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-20 11:25:22,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-05-20 11:25:22,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:22,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-20 11:25:22,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 199 proven. 24 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-05-20 11:25:23,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 180 proven. 43 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-05-20 11:25:23,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46610964] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:23,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:23,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 49 [2023-05-20 11:25:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438153131] [2023-05-20 11:25:23,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:23,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-20 11:25:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-20 11:25:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2020, Unknown=0, NotChecked=0, Total=2352 [2023-05-20 11:25:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:23,756 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:23,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.244897959183674) internal successors, (306), 49 states have internal predecessors, (306), 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) [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:23,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:24,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:24,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-20 11:25:24,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -624972790, now seen corresponding path program 7 times [2023-05-20 11:25:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:24,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092241922] [2023-05-20 11:25:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 181 proven. 62 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-05-20 11:25:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:24,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092241922] [2023-05-20 11:25:24,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092241922] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:24,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401055123] [2023-05-20 11:25:24,953 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-05-20 11:25:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:24,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:24,954 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:24,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-20 11:25:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:25,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-20 11:25:25,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 197 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-05-20 11:25:25,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 197 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-05-20 11:25:25,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401055123] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:25,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:25,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 54 [2023-05-20 11:25:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756515378] [2023-05-20 11:25:25,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:25,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-05-20 11:25:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-05-20 11:25:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2023-05-20 11:25:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:25,948 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:25,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.685185185185185) internal successors, (307), 54 states have internal predecessors, (307), 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) [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:25,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:25,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:25,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:26,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:26,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-20 11:25:26,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 339132636, now seen corresponding path program 8 times [2023-05-20 11:25:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:26,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608375023] [2023-05-20 11:25:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 197 proven. 96 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-05-20 11:25:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608375023] [2023-05-20 11:25:27,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608375023] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741183826] [2023-05-20 11:25:27,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 11:25:27,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:27,115 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:27,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-20 11:25:27,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 11:25:27,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:27,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 26 conjunts are in the unsatisfiable core [2023-05-20 11:25:27,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 75 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-05-20 11:25:27,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 75 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-05-20 11:25:28,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741183826] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:28,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:28,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 64 [2023-05-20 11:25:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015719407] [2023-05-20 11:25:28,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:28,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-05-20 11:25:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-05-20 11:25:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=3402, Unknown=0, NotChecked=0, Total=4032 [2023-05-20 11:25:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:28,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:28,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.375) internal successors, (344), 64 states have internal predecessors, (344), 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) [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:28,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:28,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:29,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-20 11:25:29,106 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1696070602, now seen corresponding path program 9 times [2023-05-20 11:25:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544963032] [2023-05-20 11:25:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 104 proven. 243 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 11:25:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544963032] [2023-05-20 11:25:29,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544963032] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518314516] [2023-05-20 11:25:29,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 11:25:29,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:29,618 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:29,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-20 11:25:30,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-05-20 11:25:30,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:30,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 32 conjunts are in the unsatisfiable core [2023-05-20 11:25:30,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 229 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:30,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 229 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:31,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518314516] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:31,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:31,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 33, 33] total 89 [2023-05-20 11:25:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846932242] [2023-05-20 11:25:31,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:31,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-05-20 11:25:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-05-20 11:25:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=841, Invalid=6991, Unknown=0, NotChecked=0, Total=7832 [2023-05-20 11:25:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:31,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:31,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 5.730337078651686) internal successors, (510), 89 states have internal predecessors, (510), 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) [2023-05-20 11:25:31,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:31,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:31,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:34,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:34,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-20 11:25:34,584 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1029342502, now seen corresponding path program 10 times [2023-05-20 11:25:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:34,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510074368] [2023-05-20 11:25:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 159 proven. 310 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:35,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510074368] [2023-05-20 11:25:35,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510074368] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:35,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304437112] [2023-05-20 11:25:35,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 11:25:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:35,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:35,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:35,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-20 11:25:35,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 11:25:35,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:35,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2023-05-20 11:25:35,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:36,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 246 proven. 223 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:25:37,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304437112] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:37,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:37,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 84 [2023-05-20 11:25:37,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843096571] [2023-05-20 11:25:37,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:37,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-05-20 11:25:37,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:37,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-05-20 11:25:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=5943, Unknown=0, NotChecked=0, Total=6972 [2023-05-20 11:25:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:37,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:37,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 5.261904761904762) internal successors, (442), 84 states have internal predecessors, (442), 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) [2023-05-20 11:25:37,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:37,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:37,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:37,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-05-20 11:25:38,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:38,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-05-20 11:25:38,906 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1736743570, now seen corresponding path program 11 times [2023-05-20 11:25:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:38,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728425169] [2023-05-20 11:25:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 553 proven. 240 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-05-20 11:25:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:39,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728425169] [2023-05-20 11:25:39,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728425169] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:39,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140304167] [2023-05-20 11:25:39,847 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-20 11:25:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:39,848 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:39,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-20 11:25:40,114 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2023-05-20 11:25:40,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:40,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-20 11:25:40,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 136 proven. 496 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2023-05-20 11:25:41,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 145 proven. 190 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2023-05-20 11:25:41,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140304167] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:41,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:41,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 43, 14] total 91 [2023-05-20 11:25:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434874174] [2023-05-20 11:25:41,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:41,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2023-05-20 11:25:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2023-05-20 11:25:41,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=7735, Unknown=0, NotChecked=0, Total=8190 [2023-05-20 11:25:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:41,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:41,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 5.054945054945055) internal successors, (460), 91 states have internal predecessors, (460), 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) [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-05-20 11:25:41,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-05-20 11:25:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2023-05-20 11:25:49,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:49,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:49,292 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1999711886, now seen corresponding path program 12 times [2023-05-20 11:25:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:49,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063261524] [2023-05-20 11:25:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:25:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 511 proven. 302 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-20 11:25:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:25:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063261524] [2023-05-20 11:25:50,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063261524] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:25:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899087346] [2023-05-20 11:25:50,330 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-05-20 11:25:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:25:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:25:50,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:25:50,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-20 11:25:50,773 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-05-20 11:25:50,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:25:50,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-20 11:25:50,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:25:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 560 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:51,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:25:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 505 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:25:53,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899087346] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:25:53,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:25:53,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 121 [2023-05-20 11:25:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316829992] [2023-05-20 11:25:53,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:25:53,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2023-05-20 11:25:53,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:25:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2023-05-20 11:25:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1652, Invalid=12868, Unknown=0, NotChecked=0, Total=14520 [2023-05-20 11:25:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:53,358 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:25:53,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 5.347107438016529) internal successors, (647), 121 states have internal predecessors, (647), 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) [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:53,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:53,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-05-20 11:25:53,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 180 states. [2023-05-20 11:25:53,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:25:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:25:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:25:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 11:25:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2023-05-20 11:25:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-05-20 11:25:54,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-20 11:25:54,771 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:25:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:25:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2116891104, now seen corresponding path program 13 times [2023-05-20 11:25:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:25:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594944337] [2023-05-20 11:25:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:25:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:25:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 11:25:54,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 11:25:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 11:25:55,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 11:25:55,150 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 11:25:55,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 11:25:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 11:25:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 11:25:55,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-05-20 11:25:55,156 INFO L444 BasicCegarLoop]: Path program histogram: [13, 1, 1, 1, 1] [2023-05-20 11:25:55,160 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 11:25:55,160 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 11:25:55,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 11:25:55 BasicIcfg [2023-05-20 11:25:55,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 11:25:55,278 INFO L158 Benchmark]: Toolchain (without parser) took 45759.31ms. Allocated memory was 190.8MB in the beginning and 625.0MB in the end (delta: 434.1MB). Free memory was 133.7MB in the beginning and 458.7MB in the end (delta: -325.0MB). Peak memory consumption was 360.7MB. Max. memory is 8.0GB. [2023-05-20 11:25:55,278 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 11:25:55,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.42ms. Allocated memory is still 190.8MB. Free memory was 133.4MB in the beginning and 163.5MB in the end (delta: -30.1MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2023-05-20 11:25:55,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.41ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 161.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 11:25:55,279 INFO L158 Benchmark]: Boogie Preprocessor took 17.44ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 160.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-20 11:25:55,279 INFO L158 Benchmark]: RCFGBuilder took 401.40ms. Allocated memory is still 190.8MB. Free memory was 160.0MB in the beginning and 133.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-05-20 11:25:55,279 INFO L158 Benchmark]: TraceAbstraction took 45061.99ms. Allocated memory was 190.8MB in the beginning and 625.0MB in the end (delta: 434.1MB). Free memory was 132.2MB in the beginning and 458.7MB in the end (delta: -326.6MB). Peak memory consumption was 358.7MB. Max. memory is 8.0GB. [2023-05-20 11:25:55,280 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.10ms. Allocated memory is still 190.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.42ms. Allocated memory is still 190.8MB. Free memory was 133.4MB in the beginning and 163.5MB in the end (delta: -30.1MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.41ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 161.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.44ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 160.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 401.40ms. Allocated memory is still 190.8MB. Free memory was 160.0MB in the beginning and 133.2MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 45061.99ms. Allocated memory was 190.8MB in the beginning and 625.0MB in the end (delta: 434.1MB). Free memory was 132.2MB in the beginning and 458.7MB in the end (delta: -326.6MB). Peak memory consumption was 358.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6002, independent: 4167, independent conditional: 3244, independent unconditional: 923, dependent: 1835, dependent conditional: 1820, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4319, independent: 4167, independent conditional: 3244, independent unconditional: 923, dependent: 152, dependent conditional: 137, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4319, independent: 4167, independent conditional: 3244, independent unconditional: 923, dependent: 152, dependent conditional: 137, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5789, independent: 4167, independent conditional: 0, independent unconditional: 4167, dependent: 1622, dependent conditional: 1470, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5789, independent: 4167, independent conditional: 0, independent unconditional: 4167, dependent: 1622, dependent conditional: 279, dependent unconditional: 1343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5789, independent: 4167, independent conditional: 0, independent unconditional: 4167, dependent: 1622, dependent conditional: 279, dependent unconditional: 1343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 802, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 49, dependent conditional: 34, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 802, independent: 752, independent conditional: 0, independent unconditional: 752, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 50, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 49, dependent conditional: 34, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 49, dependent conditional: 34, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 201, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 161, dependent conditional: 101, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5789, independent: 3414, independent conditional: 0, independent unconditional: 3414, dependent: 1573, dependent conditional: 245, dependent unconditional: 1328, unknown: 802, unknown conditional: 34, unknown unconditional: 768] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 753, Positive conditional cache size: 0, Positive unconditional cache size: 753, Negative cache size: 49, Negative conditional cache size: 34, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1191, Maximal queried relation: 15, Independence queries for same thread: 1683 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 234, Number of trivial persistent sets: 184, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 938, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6002, independent: 4167, independent conditional: 3244, independent unconditional: 923, dependent: 1835, dependent conditional: 1820, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4319, independent: 4167, independent conditional: 3244, independent unconditional: 923, dependent: 152, dependent conditional: 137, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4319, independent: 4167, independent conditional: 3244, independent unconditional: 923, dependent: 152, dependent conditional: 137, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5789, independent: 4167, independent conditional: 0, independent unconditional: 4167, dependent: 1622, dependent conditional: 1470, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5789, independent: 4167, independent conditional: 0, independent unconditional: 4167, dependent: 1622, dependent conditional: 279, dependent unconditional: 1343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5789, independent: 4167, independent conditional: 0, independent unconditional: 4167, dependent: 1622, dependent conditional: 279, dependent unconditional: 1343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 802, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 49, dependent conditional: 34, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 802, independent: 752, independent conditional: 0, independent unconditional: 752, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 50, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 49, dependent conditional: 34, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 49, dependent conditional: 34, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 201, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 161, dependent conditional: 101, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5789, independent: 3414, independent conditional: 0, independent unconditional: 3414, dependent: 1573, dependent conditional: 245, dependent unconditional: 1328, unknown: 802, unknown conditional: 34, unknown unconditional: 768] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 753, Positive conditional cache size: 0, Positive unconditional cache size: 753, Negative cache size: 49, Negative conditional cache size: 34, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1191, Maximal queried relation: 15, Independence queries for same thread: 1683 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, counter=0, N=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, counter=0, N=0, t1={9:0}, t2={7:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=10, A={0:0}, counter=0, N=10, t1={9:0}, t2={7:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=10] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=10] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, malloc(sizeof(int) * (size_t)size)={5:0}, N=10, size=10] [L97] 0 int i = 0; VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=0, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=0, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=0, A={0:0}, arr={5:0}, counter=0, i=0, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=1, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=1, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=3, A={0:0}, arr={5:0}, counter=0, i=1, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=2, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=2, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=2147483603, A={0:0}, arr={5:0}, counter=0, i=2, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=3, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=3, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=-4, A={0:0}, arr={5:0}, counter=0, i=3, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=4, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=4, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=11, A={0:0}, arr={5:0}, counter=0, i=4, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=5, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=5, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=0, A={0:0}, arr={5:0}, counter=0, i=5, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=6, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=6, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=14, A={0:0}, arr={5:0}, counter=0, i=6, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=7, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=7, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=15, A={0:0}, arr={5:0}, counter=0, i=7, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=8, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=8, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=-5, A={0:0}, arr={5:0}, counter=0, i=8, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=9, N=10, size=10] [L97] COND TRUE 0 i < size VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=9, N=10, size=10] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=10, __VERIFIER_nondet_int()=-6, A={0:0}, arr={5:0}, counter=0, i=9, N=10, size=10] [L97] 0 i++ VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=10, N=10, size=10] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=10, A={0:0}, arr={5:0}, counter=0, i=10, N=10, size=10] [L100] 0 return arr; VAL [\old(size)=10, \result={5:0}, A={0:0}, arr={5:0}, counter=0, i=10, N=10, size=10] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={5:0}, counter=0, create_fresh_int_array(N)={5:0}, N=10, t1={9:0}, t2={7:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={5:0}, counter=0, N=10, pthread_create(&t1, 0, thread1, 0)=-2, t1={9:0}, t2={7:0}] [L49] 1 int i=0; VAL [A={5:0}, counter=0, i=0, N=10] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=0, i=0, N=10, tmp=0] [L49] 1 i++ VAL [A={5:0}, counter=0, i=0, i++=0, N=10, tmp=0] [L49] 1 i++ VAL [A={5:0}, counter=0, i=1, i++=0, N=10, tmp=0] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={5:0}, counter=0, N=10, pthread_create(&t2, 0, thread2, 0)=-1, t1={9:0}, t2={7:0}] [L62] 2 int i=0; VAL [A={5:0}, counter=0, i=0, N=10] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L83] 0 \read(t1) VAL [\read(t1)=-2, A={5:0}, counter=0, N=10, t1={9:0}, t2={7:0}] [L54] 1 counter = tmp VAL [A={5:0}, counter=3, i=1, N=10, tmp=3] [L67] 2 counter = tmp VAL [A={5:0}, counter=0, i=0, N=10, tmp=0] [L49] 1 i++ VAL [A={5:0}, counter=0, i=1, i++=1, N=10, tmp=3] [L62] 2 i++ VAL [A={5:0}, counter=0, i=0, i++=0, N=10, tmp=0] [L49] 1 i++ VAL [A={5:0}, counter=0, i=2, i++=1, N=10, tmp=3] [L62] 2 i++ VAL [A={5:0}, counter=0, i=1, i++=0, N=10, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=2147483603, i=2, N=10, tmp=2147483603] [L67] 2 counter = tmp VAL [A={5:0}, counter=-3, i=1, N=10, tmp=-3] [L49] 1 i++ VAL [A={5:0}, counter=-3, i=2, i++=2, N=10, tmp=2147483603] [L62] 2 i++ VAL [A={5:0}, counter=-3, i=1, i++=1, N=10, tmp=-3] [L49] 1 i++ VAL [A={5:0}, counter=-3, i=3, i++=2, N=10, tmp=2147483603] [L62] 2 i++ VAL [A={5:0}, counter=-3, i=2, i++=1, N=10, tmp=-3] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-7, i=3, N=10, tmp=-7] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483606, i=2, N=10, tmp=-2147483606] [L49] 1 i++ VAL [A={5:0}, counter=-2147483606, i=3, i++=3, N=10, tmp=-7] [L62] 2 i++ VAL [A={5:0}, counter=-2147483606, i=2, i++=2, N=10, tmp=-2147483606] [L49] 1 i++ VAL [A={5:0}, counter=-2147483606, i=4, i++=3, N=10, tmp=-7] [L62] 2 i++ VAL [A={5:0}, counter=-2147483606, i=3, i++=2, N=10, tmp=-2147483606] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-2147483595, i=4, N=10, tmp=-2147483595] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483602, i=3, N=10, tmp=-2147483602] [L49] 1 i++ VAL [A={5:0}, counter=-2147483602, i=4, i++=4, N=10, tmp=-2147483595] [L62] 2 i++ VAL [A={5:0}, counter=-2147483602, i=3, i++=3, N=10, tmp=-2147483602] [L49] 1 i++ VAL [A={5:0}, counter=-2147483602, i=5, i++=4, N=10, tmp=-2147483595] [L62] 2 i++ VAL [A={5:0}, counter=-2147483602, i=4, i++=3, N=10, tmp=-2147483602] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-2147483602, i=5, N=10, tmp=-2147483602] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483613, i=4, N=10, tmp=-2147483613] [L49] 1 i++ VAL [A={5:0}, counter=-2147483613, i=5, i++=5, N=10, tmp=-2147483602] [L62] 2 i++ VAL [A={5:0}, counter=-2147483613, i=4, i++=4, N=10, tmp=-2147483613] [L49] 1 i++ VAL [A={5:0}, counter=-2147483613, i=6, i++=5, N=10, tmp=-2147483602] [L62] 2 i++ VAL [A={5:0}, counter=-2147483613, i=5, i++=4, N=10, tmp=-2147483613] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-2147483599, i=6, N=10, tmp=-2147483599] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483613, i=5, N=10, tmp=-2147483613] [L49] 1 i++ VAL [A={5:0}, counter=-2147483613, i=6, i++=6, N=10, tmp=-2147483599] [L62] 2 i++ VAL [A={5:0}, counter=-2147483613, i=5, i++=5, N=10, tmp=-2147483613] [L49] 1 i++ VAL [A={5:0}, counter=-2147483613, i=7, i++=6, N=10, tmp=-2147483599] [L62] 2 i++ VAL [A={5:0}, counter=-2147483613, i=6, i++=5, N=10, tmp=-2147483613] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-2147483598, i=7, N=10, tmp=-2147483598] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483627, i=6, N=10, tmp=-2147483627] [L49] 1 i++ VAL [A={5:0}, counter=-2147483627, i=7, i++=7, N=10, tmp=-2147483598] [L62] 2 i++ VAL [A={5:0}, counter=-2147483627, i=6, i++=6, N=10, tmp=-2147483627] [L49] 1 i++ VAL [A={5:0}, counter=-2147483627, i=8, i++=7, N=10, tmp=-2147483598] [L62] 2 i++ VAL [A={5:0}, counter=-2147483627, i=7, i++=6, N=10, tmp=-2147483627] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-2147483632, i=8, N=10, tmp=-2147483632] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483642, i=7, N=10, tmp=-2147483642] [L49] 1 i++ VAL [A={5:0}, counter=-2147483642, i=8, i++=8, N=10, tmp=-2147483632] [L62] 2 i++ VAL [A={5:0}, counter=-2147483642, i=7, i++=7, N=10, tmp=-2147483642] [L49] 1 i++ VAL [A={5:0}, counter=-2147483642, i=9, i++=8, N=10, tmp=-2147483632] [L62] 2 i++ VAL [A={5:0}, counter=-2147483642, i=8, i++=7, N=10, tmp=-2147483642] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L64] EXPR 2 A[i] [L64] CALL, EXPR 2 minus(counter, A[i]) [L104] CALL 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={5:0}, counter=-2147483648, i=9, N=10, tmp=-2147483648] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483637, i=8, N=10, tmp=-2147483637] [L49] 1 i++ VAL [A={5:0}, counter=-2147483637, i=9, i++=9, N=10, tmp=-2147483648] [L62] 2 i++ VAL [A={5:0}, counter=-2147483637, i=8, i++=8, N=10, tmp=-2147483637] [L49] 1 i++ VAL [A={5:0}, counter=-2147483637, i=10, i++=9, N=10, tmp=-2147483648] [L62] 2 i++ VAL [A={5:0}, counter=-2147483637, i=9, i++=8, N=10, tmp=-2147483637] [L49] COND FALSE 1 !(i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L83] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-2, A={5:0}, counter=-2147483637, N=10, t1={9:0}, t2={7:0}] [L67] 2 counter = tmp VAL [A={5:0}, counter=-2147483631, i=9, N=10, tmp=-2147483631] [L62] 2 i++ VAL [A={5:0}, counter=-2147483631, i=9, i++=9, N=10, tmp=-2147483631] [L84] 0 \read(t2) VAL [\read(t2)=-1, A={5:0}, counter=-2147483631, N=10, t1={9:0}, t2={7:0}] [L62] 2 i++ VAL [A={5:0}, counter=-2147483631, i=10, N=10, tmp=-2147483631] [L62] COND FALSE 2 !(i