/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 LOOP -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-218013a [2023-05-04 20:58:13,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 20:58:13,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 20:58:13,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 20:58:13,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 20:58:13,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 20:58:13,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 20:58:13,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 20:58:13,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 20:58:13,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 20:58:13,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 20:58:13,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 20:58:13,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 20:58:13,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 20:58:13,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 20:58:13,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 20:58:13,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 20:58:13,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 20:58:13,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 20:58:13,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 20:58:13,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 20:58:13,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 20:58:13,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 20:58:13,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 20:58:13,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 20:58:13,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 20:58:13,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 20:58:13,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 20:58:13,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 20:58:13,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 20:58:13,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 20:58:13,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 20:58:13,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 20:58:13,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 20:58:13,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 20:58:13,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 20:58:13,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 20:58:13,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 20:58:13,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 20:58:13,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 20:58:13,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 20:58:13,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 20:58:13,399 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 20:58:13,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 20:58:13,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 20:58:13,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 20:58:13,400 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 20:58:13,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 20:58:13,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 20:58:13,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 20:58:13,400 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 20:58:13,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 20:58:13,401 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 20:58:13,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:58:13,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 20:58:13,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 20:58:13,403 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 20:58:13,403 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 -> LOOP [2023-05-04 20:58:13,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 20:58:13,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 20:58:13,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 20:58:13,566 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 20:58:13,566 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 20:58:13,567 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-04 20:58:13,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678fc7338/f5d4f5e711fe44f2a9bf6271797819cf/FLAG2a0e3e9b1 [2023-05-04 20:58:13,961 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 20:58:13,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-05-04 20:58:13,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678fc7338/f5d4f5e711fe44f2a9bf6271797819cf/FLAG2a0e3e9b1 [2023-05-04 20:58:14,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678fc7338/f5d4f5e711fe44f2a9bf6271797819cf [2023-05-04 20:58:14,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 20:58:14,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 20:58:14,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 20:58:14,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 20:58:14,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 20:58:14,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ad658b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14, skipping insertion in model container [2023-05-04 20:58:14,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 20:58:14,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 20:58:14,531 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-04 20:58:14,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:58:14,541 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 20:58:14,552 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-04 20:58:14,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:58:14,564 INFO L208 MainTranslator]: Completed translation [2023-05-04 20:58:14,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14 WrapperNode [2023-05-04 20:58:14,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 20:58:14,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 20:58:14,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 20:58:14,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 20:58:14,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,590 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-05-04 20:58:14,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 20:58:14,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 20:58:14,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 20:58:14,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 20:58:14,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,607 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 20:58:14,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 20:58:14,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 20:58:14,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 20:58:14,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (1/1) ... [2023-05-04 20:58:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:58:14,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:14,633 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-04 20:58:14,637 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-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 20:58:14,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 20:58:14,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 20:58:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 20:58:14,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 20:58:14,660 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 20:58:14,725 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 20:58:14,727 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 20:58:14,962 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 20:58:15,070 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 20:58:15,070 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 20:58:15,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:58:15 BoogieIcfgContainer [2023-05-04 20:58:15,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 20:58:15,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 20:58:15,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 20:58:15,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 20:58:15,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:58:14" (1/3) ... [2023-05-04 20:58:15,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e9a8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:58:15, skipping insertion in model container [2023-05-04 20:58:15,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:58:14" (2/3) ... [2023-05-04 20:58:15,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e9a8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:58:15, skipping insertion in model container [2023-05-04 20:58:15,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:58:15" (3/3) ... [2023-05-04 20:58:15,081 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-05-04 20:58:15,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 20:58:15,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 20:58:15,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 20:58:15,092 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 20:58:15,128 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 20:58:15,168 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:58:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 20:58:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:15,170 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-04 20:58:15,175 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-04 20:58:15,204 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 20:58:15,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 20:58:15,228 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;@1b7355f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:58:15,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 20:58:15,411 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-04 20:58:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -345551080, now seen corresponding path program 1 times [2023-05-04 20:58:15,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:15,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935104620] [2023-05-04 20:58:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:15,633 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-04 20:58:15,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:15,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935104620] [2023-05-04 20:58:15,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935104620] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:15,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:15,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 20:58:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728424583] [2023-05-04 20:58:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:15,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 20:58:15,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 20:58:15,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 20:58:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:15,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:15,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 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-04 20:58:15,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:15,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 20:58:15,695 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-04 20:58:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash -498458182, now seen corresponding path program 1 times [2023-05-04 20:58:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:15,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997080933] [2023-05-04 20:58:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:15,932 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-04 20:58:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997080933] [2023-05-04 20:58:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997080933] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:58:15,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:58:15,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 20:58:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087943020] [2023-05-04 20:58:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:15,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 20:58:15,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:15,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 20:58:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 20:58:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:15,935 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:15,936 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-04 20:58:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:15,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:16,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 20:58:16,003 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-04 20:58:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1588344948, now seen corresponding path program 1 times [2023-05-04 20:58:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:16,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197401881] [2023-05-04 20:58:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:16,222 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-04 20:58:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:16,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197401881] [2023-05-04 20:58:16,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197401881] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521397507] [2023-05-04 20:58:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:16,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:16,227 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-04 20:58:16,261 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-04 20:58:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 20:58:16,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:16,492 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-04 20:58:16,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 20:58:16,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521397507] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:16,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 20:58:16,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 20:58:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307753228] [2023-05-04 20:58:16,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:58:16,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 20:58:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 20:58:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 20:58:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:16,636 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:16,636 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-04 20:58:16,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:16,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:16,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:16,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 20:58:16,950 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-04 20:58:16,951 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-04 20:58:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 802378100, now seen corresponding path program 1 times [2023-05-04 20:58:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:16,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860098567] [2023-05-04 20:58:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:17,194 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-04 20:58:17,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:17,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860098567] [2023-05-04 20:58:17,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860098567] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:17,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023074982] [2023-05-04 20:58:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:17,196 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-04 20:58:17,276 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-04 20:58:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:17,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 20:58:17,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 20:58:17,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 20:58:17,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023074982] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:58:17,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:58:17,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 20:58:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788349640] [2023-05-04 20:58:17,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:58:17,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 20:58:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 20:58:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-04 20:58:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:17,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:17,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.583333333333333) internal successors, (182), 24 states have internal predecessors, (182), 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-04 20:58:17,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:17,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:17,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:17,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:17,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 20:58:18,095 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-04 20:58:18,096 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-04 20:58:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -334010782, now seen corresponding path program 2 times [2023-05-04 20:58:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:18,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248174217] [2023-05-04 20:58:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:18,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 20:58:18,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:18,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248174217] [2023-05-04 20:58:18,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248174217] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:18,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842139687] [2023-05-04 20:58:18,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:58:18,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:18,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:18,261 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-04 20:58:18,294 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-04 20:58:18,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:58:18,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:58:18,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 20:58:18,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 20:58:18,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 20:58:18,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842139687] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:58:18,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:58:18,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 22 [2023-05-04 20:58:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986834196] [2023-05-04 20:58:18,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:58:18,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-04 20:58:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-04 20:58:18,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2023-05-04 20:58:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:18,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:18,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.909090909090908) internal successors, (196), 22 states have internal predecessors, (196), 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-04 20:58:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:18,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 20:58:19,524 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-04 20:58:19,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-04 20:58:19,719 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-04 20:58:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2128053518, now seen corresponding path program 3 times [2023-05-04 20:58:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:19,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010354976] [2023-05-04 20:58:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-04 20:58:19,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:19,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010354976] [2023-05-04 20:58:19,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010354976] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:19,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415993387] [2023-05-04 20:58:19,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 20:58:19,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:19,986 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-04 20:58:19,988 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-04 20:58:20,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-05-04 20:58:20,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:58:20,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjunts are in the unsatisfiable core [2023-05-04 20:58:20,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 20:58:20,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 20:58:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415993387] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:58:20,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:58:20,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-05-04 20:58:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059239130] [2023-05-04 20:58:20,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:58:20,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-04 20:58:20,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-04 20:58:20,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2023-05-04 20:58:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:20,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:20,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.0) internal successors, (259), 37 states have internal predecessors, (259), 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-04 20:58:20,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:20,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:20,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:20,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:20,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 20:58:20,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:21,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 20:58:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:21,059 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-04 20:58:21,244 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-04 20:58:21,244 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-04 20:58:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -870478624, now seen corresponding path program 4 times [2023-05-04 20:58:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:21,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115074069] [2023-05-04 20:58:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 70 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 20:58:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115074069] [2023-05-04 20:58:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115074069] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168330989] [2023-05-04 20:58:21,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 20:58:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:21,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:21,626 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-04 20:58:21,651 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-04 20:58:21,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 20:58:21,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:58:21,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-04 20:58:21,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 20:58:22,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 20:58:22,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168330989] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:58:22,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:58:22,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 46 [2023-05-04 20:58:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22109396] [2023-05-04 20:58:22,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:58:22,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-05-04 20:58:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-05-04 20:58:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1737, Unknown=0, NotChecked=0, Total=2070 [2023-05-04 20:58:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:22,401 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:22,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.1521739130434785) internal successors, (283), 46 states have internal predecessors, (283), 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-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 20:58:22,735 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-04 20:58:22,933 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-04 20:58:22,934 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-04 20:58:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:22,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2096597810, now seen corresponding path program 5 times [2023-05-04 20:58:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:22,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154394733] [2023-05-04 20:58:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 39 proven. 90 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 20:58:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154394733] [2023-05-04 20:58:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154394733] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936593475] [2023-05-04 20:58:23,271 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-04 20:58:23,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:23,272 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-04 20:58:23,287 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-04 20:58:23,381 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-05-04 20:58:23,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:58:23,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 20:58:23,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-05-04 20:58:23,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-05-04 20:58:23,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936593475] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:58:23,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:58:23,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 10] total 38 [2023-05-04 20:58:23,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444142356] [2023-05-04 20:58:23,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:58:23,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-05-04 20:58:23,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:23,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-05-04 20:58:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2023-05-04 20:58:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:23,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:23,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.894736842105263) internal successors, (262), 38 states have internal predecessors, (262), 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-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 20:58:23,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 20:58:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-04 20:58:25,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-05-04 20:58:26,157 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-04 20:58:26,158 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-04 20:58:26,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1298826030, now seen corresponding path program 6 times [2023-05-04 20:58:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:26,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121378160] [2023-05-04 20:58:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:58:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 62 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-05-04 20:58:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:58:26,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121378160] [2023-05-04 20:58:26,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121378160] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:58:26,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748970219] [2023-05-04 20:58:26,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-05-04 20:58:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:58:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:58:26,631 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-04 20:58:26,661 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-04 20:58:26,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-05-04 20:58:26,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:58:26,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 36 conjunts are in the unsatisfiable core [2023-05-04 20:58:26,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:58:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 259 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 20:58:27,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:58:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 220 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 20:58:28,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748970219] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:58:28,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:58:28,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 30] total 73 [2023-05-04 20:58:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729292159] [2023-05-04 20:58:28,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:58:28,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-05-04 20:58:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:58:28,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-05-04 20:58:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=4566, Unknown=0, NotChecked=0, Total=5256 [2023-05-04 20:58:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:28,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:58:28,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 5.794520547945205) internal successors, (423), 73 states have internal predecessors, (423), 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-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-05-04 20:58:28,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:58:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 20:58:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 20:58:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 20:58:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 20:58:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 20:58:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-04 20:58:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 20:58:29,200 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-04 20:58:29,400 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-04 20:58:29,401 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-04 20:58:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:58:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1890157888, now seen corresponding path program 7 times [2023-05-04 20:58:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:58:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418157786] [2023-05-04 20:58:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:58:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:58:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 20:58:29,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 20:58:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 20:58:29,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 20:58:29,700 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 20:58:29,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 20:58:29,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 20:58:29,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 20:58:29,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 20:58:29,705 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2023-05-04 20:58:29,708 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 20:58:29,709 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 20:58:29,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 08:58:29 BasicIcfg [2023-05-04 20:58:29,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 20:58:29,808 INFO L158 Benchmark]: Toolchain (without parser) took 15422.40ms. Allocated memory was 185.6MB in the beginning and 419.4MB in the end (delta: 233.8MB). Free memory was 153.1MB in the beginning and 178.9MB in the end (delta: -25.8MB). Peak memory consumption was 207.4MB. Max. memory is 8.0GB. [2023-05-04 20:58:29,808 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 20:58:29,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.35ms. Allocated memory is still 185.6MB. Free memory was 153.1MB in the beginning and 155.5MB in the end (delta: -2.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-05-04 20:58:29,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.42ms. Allocated memory is still 185.6MB. Free memory was 155.5MB in the beginning and 153.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 20:58:29,809 INFO L158 Benchmark]: Boogie Preprocessor took 17.25ms. Allocated memory is still 185.6MB. Free memory was 153.4MB in the beginning and 152.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 20:58:29,809 INFO L158 Benchmark]: RCFGBuilder took 461.98ms. Allocated memory is still 185.6MB. Free memory was 151.8MB in the beginning and 125.9MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-05-04 20:58:29,810 INFO L158 Benchmark]: TraceAbstraction took 14734.47ms. Allocated memory was 185.6MB in the beginning and 419.4MB in the end (delta: 233.8MB). Free memory was 124.6MB in the beginning and 178.9MB in the end (delta: -54.4MB). Peak memory consumption was 180.3MB. Max. memory is 8.0GB. [2023-05-04 20:58:29,810 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.09ms. Allocated memory is still 185.6MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.35ms. Allocated memory is still 185.6MB. Free memory was 153.1MB in the beginning and 155.5MB in the end (delta: -2.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.42ms. Allocated memory is still 185.6MB. Free memory was 155.5MB in the beginning and 153.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.25ms. Allocated memory is still 185.6MB. Free memory was 153.4MB in the beginning and 152.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 461.98ms. Allocated memory is still 185.6MB. Free memory was 151.8MB in the beginning and 125.9MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 14734.47ms. Allocated memory was 185.6MB in the beginning and 419.4MB in the end (delta: 233.8MB). Free memory was 124.6MB in the beginning and 178.9MB in the end (delta: -54.4MB). Peak memory consumption was 180.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3796, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 1023, dependent conditional: 1013, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 120, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 559, independent: 541, independent conditional: 0, independent unconditional: 541, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 559, independent: 540, independent conditional: 0, independent unconditional: 540, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 81, dependent conditional: 34, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2921, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 130, dependent conditional: 12, dependent unconditional: 118, unknown: 559, unknown conditional: 8, unknown unconditional: 551] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 541, Positive conditional cache size: 0, Positive unconditional cache size: 541, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 8, Independence queries for same thread: 995 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 120, Number of trivial persistent sets: 100, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 615, independent: 605, independent conditional: 0, independent unconditional: 605, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3796, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 1023, dependent conditional: 1013, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2801, independent: 2773, independent conditional: 2168, independent unconditional: 605, dependent: 28, dependent conditional: 18, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 120, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2921, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 148, dependent conditional: 20, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 559, independent: 541, independent conditional: 0, independent unconditional: 541, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 559, independent: 540, independent conditional: 0, independent unconditional: 540, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 81, dependent conditional: 34, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2921, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 130, dependent conditional: 12, dependent unconditional: 118, unknown: 559, unknown conditional: 8, unknown unconditional: 551] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 541, Positive conditional cache size: 0, Positive unconditional cache size: 541, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 8, Independence queries for same thread: 995 - 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={6:0}, t2={5:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=7, A={0:0}, counter=0, N=7, t1={6:0}, t2={5: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=7] [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=7] [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)=7, A={0:0}, arr={3:0}, counter=0, malloc(sizeof(int) * (size_t)size)={3:0}, N=7, size=7] [L97] 0 int i = 0; VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=0, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=0, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=-9, A={0:0}, arr={3:0}, counter=0, i=0, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=1, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=1, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=0, A={0:0}, arr={3:0}, counter=0, i=1, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=2, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=2, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=-10, A={0:0}, arr={3:0}, counter=0, i=2, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=3, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=3, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=10, A={0:0}, arr={3:0}, counter=0, i=3, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=4, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=4, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=-4, A={0:0}, arr={3:0}, counter=0, i=4, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=5, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=5, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=11, A={0:0}, arr={3:0}, counter=0, i=5, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=6, N=7, size=7] [L97] COND TRUE 0 i < size VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=6, N=7, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=7, __VERIFIER_nondet_int()=9, A={0:0}, arr={3:0}, counter=0, i=6, N=7, size=7] [L97] 0 i++ VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=7, N=7, size=7] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=7, A={0:0}, arr={3:0}, counter=0, i=7, N=7, size=7] [L100] 0 return arr; VAL [\old(size)=7, \result={3:0}, A={0:0}, arr={3:0}, counter=0, i=7, N=7, size=7] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, counter=0, create_fresh_int_array(N)={3:0}, N=7, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, counter=0, N=7, pthread_create(&t1, 0, thread1, 0)=-2, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, counter=0, i=0, N=7] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, counter=0, N=7, pthread_create(&t2, 0, thread2, 0)=-1, t1={6:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={3:0}, counter=0, i=0, N=7] [L83] 0 \read(t1) VAL [\read(t1)=-2, A={3:0}, counter=0, N=7, t1={6:0}, t2={5: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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-9, i=0, N=7, tmp=-9] [L49] 1 i++ VAL [A={3:0}, counter=-9, i=1, N=7, tmp=-9] [L62] COND TRUE 2 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]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=0, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=1, N=7, 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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=0, i=1, N=7, tmp=0] [L49] 1 i++ VAL [A={3:0}, counter=0, i=2, N=7, tmp=0] [L62] COND TRUE 2 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]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=1, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=2, N=7, 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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-10, i=2, N=7, tmp=-10] [L49] 1 i++ VAL [A={3:0}, counter=-10, i=3, N=7, tmp=-10] [L62] COND TRUE 2 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]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=2, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=3, N=7, 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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=10, i=3, N=7, tmp=10] [L49] 1 i++ VAL [A={3:0}, counter=10, i=4, N=7, tmp=10] [L62] COND TRUE 2 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]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=3, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=4, N=7, 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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=-4, i=4, N=7, tmp=-4] [L49] 1 i++ VAL [A={3:0}, counter=-4, i=5, N=7, tmp=-4] [L62] COND TRUE 2 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]); [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]); [L67] 2 counter = tmp VAL [A={3:0}, counter=0, i=4, N=7, tmp=0] [L62] 2 i++ VAL [A={3:0}, counter=0, i=5, N=7, tmp=0] [L62] COND TRUE 2 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]); [L67] 2 counter = tmp VAL [A={3:0}, counter=-11, i=5, N=7, tmp=-11] [L62] 2 i++ VAL [A={3:0}, counter=-11, i=6, N=7, tmp=-11] [L62] COND TRUE 2 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]); [L54] 1 counter = tmp VAL [A={3:0}, counter=7, i=5, N=7, tmp=7] [L49] 1 i++ VAL [A={3:0}, counter=7, i=6, N=7, tmp=7] [L67] 2 counter = tmp VAL [A={3:0}, counter=-20, i=6, N=7, tmp=-20] [L62] 2 i++ VAL [A={3:0}, counter=-20, i=7, N=7, tmp=-20] [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={3:0}, counter=-11, i=6, N=7, tmp=-11] [L49] 1 i++ VAL [A={3:0}, counter=-11, i=7, N=7, tmp=-11] [L62] COND FALSE 2 !(i