/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 GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 16:33:58,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 16:33:58,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 16:33:58,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 16:33:58,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 16:33:58,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 16:33:58,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 16:33:58,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 16:33:58,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 16:33:58,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 16:33:58,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 16:33:58,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 16:33:58,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 16:33:58,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 16:33:58,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 16:33:58,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 16:33:58,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 16:33:58,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 16:33:58,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 16:33:58,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 16:33:58,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 16:33:58,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 16:33:58,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 16:33:58,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 16:33:58,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 16:33:58,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 16:33:58,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 16:33:58,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 16:33:58,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 16:33:58,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 16:33:58,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 16:33:58,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 16:33:58,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 16:33:58,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 16:33:58,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 16:33:58,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 16:33:58,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 16:33:58,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 16:33:58,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 16:33:58,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 16:33:58,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 16:33:58,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 16:33:58,170 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 16:33:58,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 16:33:58,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 16:33:58,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 16:33:58,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 16:33:58,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 16:33:58,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 16:33:58,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 16:33:58,171 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 16:33:58,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 16:33:58,172 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 16:33:58,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 16:33:58,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 16:33:58,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 16:33:58,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 16:33:58,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 16:33:58,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 16:33:58,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 16:33:58,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 16:33:58,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 16:33:58,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 16:33:58,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 16:33:58,175 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 16:33:58,175 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 -> GLOBAL_READ_WRITE [2023-05-04 16:33:58,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 16:33:58,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 16:33:58,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 16:33:58,387 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 16:33:58,388 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 16:33:58,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2023-05-04 16:33:58,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bff64d4e/de03a3c6393b436d87c445858954877c/FLAG9231bb2c7 [2023-05-04 16:33:58,865 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 16:33:58,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2023-05-04 16:33:58,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bff64d4e/de03a3c6393b436d87c445858954877c/FLAG9231bb2c7 [2023-05-04 16:33:59,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bff64d4e/de03a3c6393b436d87c445858954877c [2023-05-04 16:33:59,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 16:33:59,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 16:33:59,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 16:33:59,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 16:33:59,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 16:33:59,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7076a4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59, skipping insertion in model container [2023-05-04 16:33:59,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 16:33:59,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 16:33:59,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2023-05-04 16:33:59,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2023-05-04 16:33:59,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2023-05-04 16:33:59,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 16:33:59,573 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 16:33:59,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2023-05-04 16:33:59,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2023-05-04 16:33:59,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2023-05-04 16:33:59,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 16:33:59,637 INFO L208 MainTranslator]: Completed translation [2023-05-04 16:33:59,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59 WrapperNode [2023-05-04 16:33:59,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 16:33:59,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 16:33:59,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 16:33:59,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 16:33:59,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,675 INFO L138 Inliner]: procedures = 274, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2023-05-04 16:33:59,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 16:33:59,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 16:33:59,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 16:33:59,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 16:33:59,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,696 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 16:33:59,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 16:33:59,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 16:33:59,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 16:33:59,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (1/1) ... [2023-05-04 16:33:59,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 16:33:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 16:33:59,734 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 16:33:59,746 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 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 16:33:59,766 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 16:33:59,766 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 16:33:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 16:33:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 16:33:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 16:33:59,767 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 16:33:59,906 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 16:33:59,909 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 16:34:00,213 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 16:34:00,221 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 16:34:00,221 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 16:34:00,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:34:00 BoogieIcfgContainer [2023-05-04 16:34:00,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 16:34:00,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 16:34:00,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 16:34:00,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 16:34:00,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 04:33:59" (1/3) ... [2023-05-04 16:34:00,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6192bb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:34:00, skipping insertion in model container [2023-05-04 16:34:00,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:33:59" (2/3) ... [2023-05-04 16:34:00,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6192bb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:34:00, skipping insertion in model container [2023-05-04 16:34:00,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:34:00" (3/3) ... [2023-05-04 16:34:00,230 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-05-04 16:34:00,236 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 16:34:00,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 16:34:00,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 16:34:00,242 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 16:34:00,331 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 16:34:00,369 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 16:34:00,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 16:34:00,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 16:34:00,371 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 16:34:00,388 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 16:34:00,399 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 16:34:00,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 16:34:00,413 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;@7b7b1256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 16:34:00,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 16:34:00,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 345256880, now seen corresponding path program 1 times [2023-05-04 16:34:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:00,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13381580] [2023-05-04 16:34:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13381580] [2023-05-04 16:34:00,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13381580] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:00,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:00,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 16:34:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540113082] [2023-05-04 16:34:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:00,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 16:34:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 16:34:00,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 16:34:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:00,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:00,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 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 16:34:00,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:00,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 16:34:00,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:00,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1355483599, now seen corresponding path program 1 times [2023-05-04 16:34:00,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:00,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061580463] [2023-05-04 16:34:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:01,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:01,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061580463] [2023-05-04 16:34:01,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061580463] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:01,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:01,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 16:34:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811623341] [2023-05-04 16:34:01,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:01,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 16:34:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 16:34:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 16:34:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:01,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 16:34:01,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 16:34:01,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:01,343 INFO L85 PathProgramCache]: Analyzing trace with hash 649200772, now seen corresponding path program 1 times [2023-05-04 16:34:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:01,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118406737] [2023-05-04 16:34:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:01,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118406737] [2023-05-04 16:34:01,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118406737] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:01,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:01,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 16:34:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763354917] [2023-05-04 16:34:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:01,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 16:34:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 16:34:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 16:34:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,628 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:01,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 16:34:01,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 16:34:01,655 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2085131728, now seen corresponding path program 1 times [2023-05-04 16:34:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025765406] [2023-05-04 16:34:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:01,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025765406] [2023-05-04 16:34:01,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025765406] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:01,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:01,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 16:34:01,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531553569] [2023-05-04 16:34:01,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:01,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 16:34:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 16:34:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 16:34:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,748 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:01,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 16:34:01,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:01,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 16:34:01,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash 926448272, now seen corresponding path program 1 times [2023-05-04 16:34:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:01,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744250740] [2023-05-04 16:34:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:02,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744250740] [2023-05-04 16:34:02,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744250740] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:02,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:02,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 16:34:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399941569] [2023-05-04 16:34:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:02,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 16:34:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 16:34:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 16:34:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:02,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:02,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 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 16:34:02,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:02,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:02,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:02,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:02,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:02,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 16:34:02,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:02,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:02,713 INFO L85 PathProgramCache]: Analyzing trace with hash -215361403, now seen corresponding path program 1 times [2023-05-04 16:34:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:02,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117549126] [2023-05-04 16:34:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:05,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117549126] [2023-05-04 16:34:05,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117549126] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:05,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:05,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 16:34:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628855427] [2023-05-04 16:34:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:05,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 16:34:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 16:34:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2023-05-04 16:34:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:05,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:05,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 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 16:34:05,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:05,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:05,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:05,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:05,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:05,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 16:34:07,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 16:34:07,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1346933330, now seen corresponding path program 1 times [2023-05-04 16:34:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:07,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927237703] [2023-05-04 16:34:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:07,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:07,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927237703] [2023-05-04 16:34:07,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927237703] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:07,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:07,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 16:34:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520901049] [2023-05-04 16:34:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:07,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 16:34:07,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 16:34:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 16:34:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:07,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:07,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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 16:34:07,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:07,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:07,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 16:34:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 16:34:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:07,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 16:34:07,366 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1507188205, now seen corresponding path program 1 times [2023-05-04 16:34:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:07,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969142172] [2023-05-04 16:34:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:07,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:08,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969142172] [2023-05-04 16:34:08,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969142172] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:08,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:08,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-05-04 16:34:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191106152] [2023-05-04 16:34:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:08,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-04 16:34:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-04 16:34:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2023-05-04 16:34:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:08,963 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:08,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 states have internal predecessors, (132), 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 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:08,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 16:34:10,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 16:34:10,674 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1229888891, now seen corresponding path program 1 times [2023-05-04 16:34:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:10,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032529557] [2023-05-04 16:34:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032529557] [2023-05-04 16:34:10,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032529557] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:10,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:10,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 16:34:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716052109] [2023-05-04 16:34:10,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:10,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 16:34:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 16:34:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 16:34:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:10,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:10,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 16:34:10,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:10,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:10,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:10,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 16:34:10,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:10,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 16:34:10,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 16:34:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 16:34:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:10,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 16:34:10,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 16:34:10,895 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 16:34:10,896 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 16:34:10,902 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 16:34:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 16:34:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 16:34:10,906 INFO L229 MonitoredProcess]: Starting monitored process 3 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 16:34:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 16:34:10,950 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 16:34:10,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 16:34:10,952 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;@7b7b1256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 16:34:10,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 16:34:11,131 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 16:34:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 935827827, now seen corresponding path program 1 times [2023-05-04 16:34:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993676115] [2023-05-04 16:34:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993676115] [2023-05-04 16:34:11,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993676115] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:11,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:11,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 16:34:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493466195] [2023-05-04 16:34:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 16:34:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 16:34:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 16:34:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:11,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 16:34:11,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 16:34:11,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 16:34:11,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 16:34:11,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 16:34:11,193 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 16:34:11,193 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 16:34:11,195 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 16:34:11,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 16:34:11,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 16:34:11,200 INFO L229 MonitoredProcess]: Starting monitored process 4 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 16:34:11,205 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 16:34:11,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 16:34:11,206 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;@7b7b1256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 16:34:11,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 16:34:11,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-05-04 16:34:11,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -424078120, now seen corresponding path program 1 times [2023-05-04 16:34:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:11,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878171259] [2023-05-04 16:34:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:11,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:11,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878171259] [2023-05-04 16:34:11,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878171259] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:11,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:11,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 16:34:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657927928] [2023-05-04 16:34:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:11,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 16:34:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 16:34:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 16:34:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:11,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 16:34:11,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:11,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 16:34:11,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1425738159, now seen corresponding path program 1 times [2023-05-04 16:34:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:11,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548368542] [2023-05-04 16:34:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 16:34:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:11,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548368542] [2023-05-04 16:34:11,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548368542] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:11,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:11,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 16:34:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800114616] [2023-05-04 16:34:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:11,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 16:34:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 16:34:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 16:34:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,476 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:11,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 16:34:11,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:11,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:11,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 16:34:11,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash 979837135, now seen corresponding path program 1 times [2023-05-04 16:34:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:11,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71662177] [2023-05-04 16:34:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 16:34:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 16:34:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 16:34:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71662177] [2023-05-04 16:34:11,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71662177] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 16:34:11,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 16:34:11,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 16:34:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163612490] [2023-05-04 16:34:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 16:34:11,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 16:34:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 16:34:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 16:34:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 16:34:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:11,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 16:34:11,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.333333333333332) internal successors, (220), 12 states have internal predecessors, (220), 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 16:34:11,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:11,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:11,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 16:34:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 16:34:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 16:34:12,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 16:34:12,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 16:34:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 16:34:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash -870301436, now seen corresponding path program 1 times [2023-05-04 16:34:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 16:34:12,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013253779] [2023-05-04 16:34:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 16:34:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 16:34:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 16:34:12,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 16:34:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 16:34:12,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 16:34:12,386 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 16:34:12,386 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 16:34:12,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 16:34:12,387 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-05-04 16:34:12,388 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2023-05-04 16:34:12,390 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 16:34:12,390 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 16:34:12,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 04:34:12 BasicIcfg [2023-05-04 16:34:12,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 16:34:12,578 INFO L158 Benchmark]: Toolchain (without parser) took 13359.39ms. Allocated memory was 168.8MB in the beginning and 511.7MB in the end (delta: 342.9MB). Free memory was 137.2MB in the beginning and 445.8MB in the end (delta: -308.7MB). Peak memory consumption was 308.1MB. Max. memory is 8.0GB. [2023-05-04 16:34:12,578 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 168.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 16:34:12,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.70ms. Allocated memory was 168.8MB in the beginning and 238.0MB in the end (delta: 69.2MB). Free memory was 137.0MB in the beginning and 187.2MB in the end (delta: -50.3MB). Peak memory consumption was 23.4MB. Max. memory is 8.0GB. [2023-05-04 16:34:12,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.15ms. Allocated memory is still 238.0MB. Free memory was 187.2MB in the beginning and 184.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 16:34:12,579 INFO L158 Benchmark]: Boogie Preprocessor took 22.91ms. Allocated memory is still 238.0MB. Free memory was 184.1MB in the beginning and 182.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 16:34:12,579 INFO L158 Benchmark]: RCFGBuilder took 522.74ms. Allocated memory is still 238.0MB. Free memory was 182.0MB in the beginning and 158.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-04 16:34:12,579 INFO L158 Benchmark]: TraceAbstraction took 12353.74ms. Allocated memory was 238.0MB in the beginning and 511.7MB in the end (delta: 273.7MB). Free memory was 157.3MB in the beginning and 445.8MB in the end (delta: -288.5MB). Peak memory consumption was 260.4MB. Max. memory is 8.0GB. [2023-05-04 16:34:12,580 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.08ms. Allocated memory is still 168.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.70ms. Allocated memory was 168.8MB in the beginning and 238.0MB in the end (delta: 69.2MB). Free memory was 137.0MB in the beginning and 187.2MB in the end (delta: -50.3MB). Peak memory consumption was 23.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.15ms. Allocated memory is still 238.0MB. Free memory was 187.2MB in the beginning and 184.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.91ms. Allocated memory is still 238.0MB. Free memory was 184.1MB in the beginning and 182.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 522.74ms. Allocated memory is still 238.0MB. Free memory was 182.0MB in the beginning and 158.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12353.74ms. Allocated memory was 238.0MB in the beginning and 511.7MB in the end (delta: 273.7MB). Free memory was 157.3MB in the beginning and 445.8MB in the end (delta: -288.5MB). Peak memory consumption was 260.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26750, independent: 25974, independent conditional: 12144, independent unconditional: 13830, dependent: 776, dependent conditional: 701, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26096, independent: 25974, independent conditional: 12144, independent unconditional: 13830, dependent: 122, dependent conditional: 47, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26096, independent: 25974, independent conditional: 12144, independent unconditional: 13830, dependent: 122, dependent conditional: 47, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26526, independent: 25974, independent conditional: 128, independent unconditional: 25846, dependent: 552, dependent conditional: 302, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26526, independent: 25974, independent conditional: 128, independent unconditional: 25846, dependent: 552, dependent conditional: 63, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26526, independent: 25974, independent conditional: 128, independent unconditional: 25846, dependent: 552, dependent conditional: 63, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12050, independent: 11968, independent conditional: 25, independent unconditional: 11943, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12050, independent: 11939, independent conditional: 0, independent unconditional: 11939, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 275, independent: 95, independent conditional: 51, independent unconditional: 43, dependent: 180, dependent conditional: 12, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26526, independent: 14006, independent conditional: 103, independent unconditional: 13903, dependent: 470, dependent conditional: 56, dependent unconditional: 414, unknown: 12050, unknown conditional: 32, unknown unconditional: 12018] , Statistics on independence cache: Total cache size (in pairs): 12050, Positive cache size: 11968, Positive conditional cache size: 25, Positive unconditional cache size: 11943, Negative cache size: 82, Negative conditional cache size: 7, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 239, Maximal queried relation: 7, Independence queries for same thread: 654 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 2675, Number of trivial persistent sets: 2587, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13905, independent: 13830, independent conditional: 0, independent unconditional: 13830, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26750, independent: 25974, independent conditional: 12144, independent unconditional: 13830, dependent: 776, dependent conditional: 701, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26096, independent: 25974, independent conditional: 12144, independent unconditional: 13830, dependent: 122, dependent conditional: 47, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26096, independent: 25974, independent conditional: 12144, independent unconditional: 13830, dependent: 122, dependent conditional: 47, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26526, independent: 25974, independent conditional: 128, independent unconditional: 25846, dependent: 552, dependent conditional: 302, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26526, independent: 25974, independent conditional: 128, independent unconditional: 25846, dependent: 552, dependent conditional: 63, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26526, independent: 25974, independent conditional: 128, independent unconditional: 25846, dependent: 552, dependent conditional: 63, dependent unconditional: 489, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12050, independent: 11968, independent conditional: 25, independent unconditional: 11943, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12050, independent: 11939, independent conditional: 0, independent unconditional: 11939, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 275, independent: 95, independent conditional: 51, independent unconditional: 43, dependent: 180, dependent conditional: 12, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26526, independent: 14006, independent conditional: 103, independent unconditional: 13903, dependent: 470, dependent conditional: 56, dependent unconditional: 414, unknown: 12050, unknown conditional: 32, unknown unconditional: 12018] , Statistics on independence cache: Total cache size (in pairs): 12050, Positive cache size: 11968, Positive conditional cache size: 25, Positive unconditional cache size: 11943, Negative cache size: 82, Negative conditional cache size: 7, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 239, Maximal queried relation: 7, Independence queries for same thread: 654 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9075, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 325, dependent conditional: 246, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 20, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8441, independent: 8362, independent conditional: 0, independent unconditional: 8362, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8441, independent: 8358, independent conditional: 0, independent unconditional: 8358, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8889, independent: 388, independent conditional: 0, independent unconditional: 388, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8441, unknown conditional: 0, unknown unconditional: 8441] , Statistics on independence cache: Total cache size (in pairs): 8441, Positive cache size: 8362, Positive conditional cache size: 0, Positive unconditional cache size: 8362, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 206 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 307, Number of trivial persistent sets: 279, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8579, independent: 8500, independent conditional: 0, independent unconditional: 8500, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9075, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 325, dependent conditional: 246, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 20, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8441, independent: 8362, independent conditional: 0, independent unconditional: 8362, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8441, independent: 8358, independent conditional: 0, independent unconditional: 8358, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8889, independent: 388, independent conditional: 0, independent unconditional: 388, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8441, unknown conditional: 0, unknown unconditional: 8441] , Statistics on independence cache: Total cache size (in pairs): 8441, Positive cache size: 8362, Positive conditional cache size: 0, Positive unconditional cache size: 8362, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 206 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15051, independent: 14802, independent conditional: 760, independent unconditional: 14042, dependent: 249, dependent conditional: 194, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14872, independent: 14802, independent conditional: 760, independent unconditional: 14042, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14872, independent: 14802, independent conditional: 760, independent unconditional: 14042, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14899, independent: 14802, independent conditional: 0, independent unconditional: 14802, dependent: 97, dependent conditional: 27, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14899, independent: 14802, independent conditional: 0, independent unconditional: 14802, dependent: 97, dependent conditional: 11, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14899, independent: 14802, independent conditional: 0, independent unconditional: 14802, dependent: 97, dependent conditional: 11, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11176, independent: 11118, independent conditional: 0, independent unconditional: 11118, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11176, independent: 11112, independent conditional: 0, independent unconditional: 11112, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 61, dependent conditional: 3, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14899, independent: 3684, independent conditional: 0, independent unconditional: 3684, dependent: 39, dependent conditional: 8, dependent unconditional: 31, unknown: 11176, unknown conditional: 3, unknown unconditional: 11173] , Statistics on independence cache: Total cache size (in pairs): 11176, Positive cache size: 11118, Positive conditional cache size: 0, Positive unconditional cache size: 11118, Negative cache size: 58, Negative conditional cache size: 3, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 179 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 355, Number of trivial persistent sets: 313, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14097, independent: 14042, independent conditional: 0, independent unconditional: 14042, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15051, independent: 14802, independent conditional: 760, independent unconditional: 14042, dependent: 249, dependent conditional: 194, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14872, independent: 14802, independent conditional: 760, independent unconditional: 14042, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14872, independent: 14802, independent conditional: 760, independent unconditional: 14042, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14899, independent: 14802, independent conditional: 0, independent unconditional: 14802, dependent: 97, dependent conditional: 27, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14899, independent: 14802, independent conditional: 0, independent unconditional: 14802, dependent: 97, dependent conditional: 11, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14899, independent: 14802, independent conditional: 0, independent unconditional: 14802, dependent: 97, dependent conditional: 11, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11176, independent: 11118, independent conditional: 0, independent unconditional: 11118, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11176, independent: 11112, independent conditional: 0, independent unconditional: 11112, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 61, dependent conditional: 3, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14899, independent: 3684, independent conditional: 0, independent unconditional: 3684, dependent: 39, dependent conditional: 8, dependent unconditional: 31, unknown: 11176, unknown conditional: 3, unknown unconditional: 11173] , Statistics on independence cache: Total cache size (in pairs): 11176, Positive cache size: 11118, Positive conditional cache size: 0, Positive unconditional cache size: 11118, Negative cache size: 58, Negative conditional cache size: 3, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 179 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [enqueue_flag=0] [L947] 0 pthread_mutex_t m; VAL [enqueue_flag=0, m={5:0}] [L951] 0 QType queue; VAL [enqueue_flag=0, m={5:0}, queue={6:0}] [L949] 0 int stored_elements[(20)]; VAL [enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [dequeue_flag=0, enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1054] 0 pthread_t id1, id2; VAL [dequeue_flag=0, enqueue_flag=0, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1055] 0 enqueue_flag=(1) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1056] 0 dequeue_flag=(0) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L955] 0 q->tail=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L956] 0 q->amount=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 0 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L960] COND TRUE 0 q->head == q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L963] 0 return (-1); VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) VAL [dequeue_flag=0, empty(&queue)=-1, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-1, queue={6:0}, stored_elements={7:0}] [L1007] 1 int value, i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1010] CALL 1 enqueue(&queue,value) [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, pthread_create(&id2, ((void *)0), t2, &queue)=0, queue={6:0}, stored_elements={7:0}] [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L1036] 2 int i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1065] 0 \read(id1) VAL [\read(id1)=-1, dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, q->amount++=0, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, q->tail++=0, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue(&queue,value)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1013] 1 stored_elements[0]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 1 q->tail VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L960] COND FALSE 1 !(q->head == q->tail) VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L966] 1 return 0; VAL [\result=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, empty(&queue)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] 1 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L980] 1 q->element[q->tail] = x VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L981] EXPR 1 q->amount VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=1] [L981] 1 q->amount++ VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=1] [L982] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L988] EXPR 1 q->tail VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=1] [L988] 1 q->tail++ VAL [\old(x)=1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, q->tail++=1, queue={6:0}, stored_elements={7:0}, x=1] [L990] 1 return 0; VAL [\old(x)=1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=1] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=1] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=0, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=0] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=0] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->head++=0, queue={6:0}, stored_elements={7:0}, x=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=1] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=1] [L1043] 2 reach_error() VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 6899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-05-04 16:34:12,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-05-04 16:34:12,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-05-04 16:34:13,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 16:34:13,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...