/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 '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 08:25:12,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 08:25:12,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 08:25:12,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 08:25:12,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 08:25:12,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 08:25:12,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 08:25:12,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 08:25:12,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 08:25:12,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 08:25:12,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 08:25:12,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 08:25:12,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 08:25:12,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 08:25:12,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 08:25:12,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 08:25:12,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 08:25:12,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 08:25:12,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 08:25:12,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 08:25:12,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 08:25:12,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 08:25:12,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 08:25:12,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 08:25:12,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 08:25:12,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 08:25:12,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 08:25:12,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 08:25:12,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 08:25:12,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 08:25:12,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 08:25:12,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 08:25:12,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 08:25:12,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 08:25:12,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 08:25:12,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 08:25:12,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 08:25:12,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 08:25:12,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 08:25:12,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 08:25:12,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 08:25:12,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 08:25:12,250 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 08:25:12,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 08:25:12,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 08:25:12,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 08:25:12,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 08:25:12,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 08:25:12,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 08:25:12,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 08:25:12,252 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 08:25:12,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 08:25:12,253 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 08:25:12,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 08:25:12,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 08:25:12,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 08:25:12,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 08:25:12,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 08:25:12,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 08:25:12,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:25:12,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 08:25:12,256 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 08:25:12,257 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 -> 3,2 1,1 2,2 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 08:25:12,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 08:25:12,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 08:25:12,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 08:25:12,466 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 08:25:12,466 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 08:25:12,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-05-04 08:25:12,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28f6e499/f9c7dd4e07a34fae9b70e0fc4d93f06d/FLAG1090653fc [2023-05-04 08:25:12,931 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 08:25:12,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-05-04 08:25:12,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28f6e499/f9c7dd4e07a34fae9b70e0fc4d93f06d/FLAG1090653fc [2023-05-04 08:25:12,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28f6e499/f9c7dd4e07a34fae9b70e0fc4d93f06d [2023-05-04 08:25:12,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 08:25:12,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 08:25:12,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 08:25:12,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 08:25:12,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 08:25:12,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:25:12" (1/1) ... [2023-05-04 08:25:12,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e8594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:12, skipping insertion in model container [2023-05-04 08:25:12,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:25:12" (1/1) ... [2023-05-04 08:25:12,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 08:25:13,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 08:25:13,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-05-04 08:25:13,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:25:13,450 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 08:25:13,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2023-05-04 08:25:13,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:25:13,546 INFO L208 MainTranslator]: Completed translation [2023-05-04 08:25:13,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13 WrapperNode [2023-05-04 08:25:13,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 08:25:13,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 08:25:13,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 08:25:13,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 08:25:13,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,609 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2023-05-04 08:25:13,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 08:25:13,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 08:25:13,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 08:25:13,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 08:25:13,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 08:25:13,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 08:25:13,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 08:25:13,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 08:25:13,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (1/1) ... [2023-05-04 08:25:13,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:25:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:13,705 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 08:25:13,712 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 08:25:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 08:25:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 08:25:13,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 08:25:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 08:25:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 08:25:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 08:25:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 08:25:13,746 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 08:25:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 08:25:13,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 08:25:13,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 08:25:13,747 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 08:25:13,841 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 08:25:13,843 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 08:25:14,084 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 08:25:14,090 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 08:25:14,090 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2023-05-04 08:25:14,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:25:14 BoogieIcfgContainer [2023-05-04 08:25:14,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 08:25:14,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 08:25:14,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 08:25:14,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 08:25:14,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:25:12" (1/3) ... [2023-05-04 08:25:14,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a65c9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:25:14, skipping insertion in model container [2023-05-04 08:25:14,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:13" (2/3) ... [2023-05-04 08:25:14,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a65c9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:25:14, skipping insertion in model container [2023-05-04 08:25:14,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:25:14" (3/3) ... [2023-05-04 08:25:14,110 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-05-04 08:25:14,117 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 08:25:14,124 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 08:25:14,124 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-04 08:25:14,124 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 08:25:14,218 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 08:25:14,262 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:14,264 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 08:25:14,266 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 08:25:14,301 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:14,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 08:25:14,333 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;@4355cd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:14,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:25:14,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1668823948, now seen corresponding path program 1 times [2023-05-04 08:25:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:14,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880986940] [2023-05-04 08:25:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-05-04 08:25:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:15,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880986940] [2023-05-04 08:25:15,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880986940] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:15,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:15,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306779480] [2023-05-04 08:25:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:15,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:15,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:15,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:15,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 08:25:15,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:15,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 08:25:15,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -555839877, now seen corresponding path program 1 times [2023-05-04 08:25:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:15,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077299386] [2023-05-04 08:25:15,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:15,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077299386] [2023-05-04 08:25:15,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077299386] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:15,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071765033] [2023-05-04 08:25:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:15,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:15,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:15,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 08:25:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:15,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:15,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:15,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:15,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071765033] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:15,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:15,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742157272] [2023-05-04 08:25:15,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:15,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:15,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:15,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:15,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:15,771 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:15,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 08:25:15,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:15,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:15,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:16,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 08:25:16,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:16,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1613177467, now seen corresponding path program 2 times [2023-05-04 08:25:16,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:16,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525748047] [2023-05-04 08:25:16,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:16,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:16,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525748047] [2023-05-04 08:25:16,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525748047] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:16,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672385490] [2023-05-04 08:25:16,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:16,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:16,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:16,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:16,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 08:25:16,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 08:25:16,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:16,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjunts are in the unsatisfiable core [2023-05-04 08:25:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:16,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:16,586 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:16,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:16,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:16,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-04 08:25:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:16,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 08:25:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672385490] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:16,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 08:25:16,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2023-05-04 08:25:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813836826] [2023-05-04 08:25:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:16,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-05-04 08:25:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:16,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:16,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 08:25:16,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:16,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:16,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:17,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:17,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:17,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash -150954679, now seen corresponding path program 1 times [2023-05-04 08:25:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617996153] [2023-05-04 08:25:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617996153] [2023-05-04 08:25:17,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617996153] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:17,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986378466] [2023-05-04 08:25:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:17,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:17,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 08:25:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:17,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:17,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:17,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:17,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986378466] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:17,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:17,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 08:25:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907941143] [2023-05-04 08:25:17,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:17,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 08:25:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 08:25:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 08:25:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:17,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:17,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.473684210526315) internal successors, (161), 19 states have internal predecessors, (161), 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 08:25:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:17,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:17,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 08:25:17,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 08:25:17,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:17,952 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-05-04 08:25:17,954 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-05-04 08:25:17,957 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:17,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:17,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:17,968 INFO L229 MonitoredProcess]: Starting monitored process 6 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 08:25:17,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-05-04 08:25:17,977 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:17,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 08:25:17,979 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;@4355cd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:17,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 08:25:18,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1898453955, now seen corresponding path program 1 times [2023-05-04 08:25:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:18,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561591821] [2023-05-04 08:25:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:18,081 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 08:25:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:18,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561591821] [2023-05-04 08:25:18,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561591821] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:18,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:18,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767360884] [2023-05-04 08:25:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:18,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:18,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:18,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 08:25:18,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:18,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 08:25:18,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2039067449, now seen corresponding path program 1 times [2023-05-04 08:25:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:18,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259549893] [2023-05-04 08:25:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259549893] [2023-05-04 08:25:18,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259549893] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325408073] [2023-05-04 08:25:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:18,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:18,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 08:25:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:18,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:18,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:18,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:18,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325408073] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:18,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:18,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492335744] [2023-05-04 08:25:18,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:18,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:18,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 08:25:18,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:18,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:18,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:18,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:18,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1909540665, now seen corresponding path program 2 times [2023-05-04 08:25:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:18,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069231375] [2023-05-04 08:25:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:18,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069231375] [2023-05-04 08:25:18,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069231375] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:18,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817254781] [2023-05-04 08:25:18,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:18,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:18,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:18,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 08:25:18,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:18,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:18,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:18,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:18,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:18,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817254781] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:18,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:18,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 08:25:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137878228] [2023-05-04 08:25:18,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:18,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 08:25:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 08:25:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 08:25:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:18,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:18,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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 08:25:18,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:18,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:18,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:19,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:19,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1318752455, now seen corresponding path program 3 times [2023-05-04 08:25:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024451363] [2023-05-04 08:25:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:19,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024451363] [2023-05-04 08:25:19,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024451363] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:19,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632611894] [2023-05-04 08:25:19,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:25:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:19,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:19,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 08:25:19,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-05-04 08:25:19,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:19,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:25:19,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:19,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:19,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632611894] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:19,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:19,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:25:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858809362] [2023-05-04 08:25:19,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:25:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:25:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:25:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:19,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:19,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 23 states have internal predecessors, (107), 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 08:25:19,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:19,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:19,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:19,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:20,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:20,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-05-04 08:25:20,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash -639535271, now seen corresponding path program 4 times [2023-05-04 08:25:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:20,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075123255] [2023-05-04 08:25:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:25:20,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 08:25:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:25:20,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 08:25:20,338 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 08:25:20,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 08:25:20,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-04 08:25:20,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 08:25:20,340 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2023-05-04 08:25:20,340 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-05-04 08:25:20,341 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 08:25:20,341 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 08:25:20,362 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 08:25:20,365 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:20,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:20,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:20,366 INFO L229 MonitoredProcess]: Starting monitored process 10 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 08:25:20,369 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:20,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-05-04 08:25:20,370 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;@4355cd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:20,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:25:20,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-05-04 08:25:20,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2105364623, now seen corresponding path program 1 times [2023-05-04 08:25:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:20,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105675982] [2023-05-04 08:25:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:20,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105675982] [2023-05-04 08:25:20,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105675982] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:20,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:20,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152363494] [2023-05-04 08:25:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:20,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:20,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 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 08:25:20,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:20,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 08:25:20,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -72600017, now seen corresponding path program 1 times [2023-05-04 08:25:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:20,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658428472] [2023-05-04 08:25:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:20,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658428472] [2023-05-04 08:25:20,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658428472] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:20,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622064279] [2023-05-04 08:25:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:20,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:20,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:20,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:20,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 08:25:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:20,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:20,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:20,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:20,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622064279] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:20,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:20,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076260928] [2023-05-04 08:25:20,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:20,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:20,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:20,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 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 08:25:20,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:20,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:20,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-04 08:25:21,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1541117455, now seen corresponding path program 2 times [2023-05-04 08:25:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447000007] [2023-05-04 08:25:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:21,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447000007] [2023-05-04 08:25:21,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447000007] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:21,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809840252] [2023-05-04 08:25:21,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:21,183 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:21,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 08:25:21,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:21,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:21,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:21,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:21,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:21,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809840252] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:21,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:21,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 08:25:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016112001] [2023-05-04 08:25:21,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:21,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 08:25:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 08:25:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 08:25:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:21,382 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:21,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 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 08:25:21,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:21,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:21,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:21,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-04 08:25:21,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash -279097905, now seen corresponding path program 3 times [2023-05-04 08:25:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893107164] [2023-05-04 08:25:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:21,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893107164] [2023-05-04 08:25:21,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893107164] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:21,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786953201] [2023-05-04 08:25:21,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:25:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:21,977 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:22,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-04 08:25:22,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 08:25:22,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:22,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjunts are in the unsatisfiable core [2023-05-04 08:25:22,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:22,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:22,370 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:22,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:22,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:22,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:22,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:22,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-04 08:25:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-05-04 08:25:22,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:22,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_426) |c_~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:25:23,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:25:23,159 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:25:23,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:25:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 2 not checked. [2023-05-04 08:25:23,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786953201] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:23,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:23,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 32 [2023-05-04 08:25:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855660711] [2023-05-04 08:25:23,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:23,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 08:25:23,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:23,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 08:25:23,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=805, Unknown=1, NotChecked=58, Total=992 [2023-05-04 08:25:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:23,164 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:23,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.46875) internal successors, (271), 32 states have internal predecessors, (271), 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 08:25:23,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:23,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:23,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:23,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-04 08:25:26,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-05-04 08:25:26,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 08:25:26,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1827374774, now seen corresponding path program 1 times [2023-05-04 08:25:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:26,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549945553] [2023-05-04 08:25:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-05-04 08:25:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:26,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549945553] [2023-05-04 08:25:26,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549945553] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:26,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:26,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386619712] [2023-05-04 08:25:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:26,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:26,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:26,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:26,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:26,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:26,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:26,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:26,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-04 08:25:26,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:26,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 08:25:26,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -46140812, now seen corresponding path program 1 times [2023-05-04 08:25:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:26,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589535681] [2023-05-04 08:25:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:25:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589535681] [2023-05-04 08:25:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589535681] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465265046] [2023-05-04 08:25:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:26,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:26,893 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:26,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-04 08:25:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:26,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-04 08:25:26,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:25:27,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:25:27,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465265046] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:27,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:27,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2023-05-04 08:25:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200732395] [2023-05-04 08:25:27,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:27,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:25:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:25:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:25:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:27,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:27,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 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 08:25:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:27,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-05-04 08:25:27,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2109568428, now seen corresponding path program 2 times [2023-05-04 08:25:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:27,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9401343] [2023-05-04 08:25:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:27,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9401343] [2023-05-04 08:25:27,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9401343] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:27,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734753984] [2023-05-04 08:25:27,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:27,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:27,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:27,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-04 08:25:27,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:27,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:27,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 08:25:27,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:28,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:28,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734753984] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:28,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:28,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-05-04 08:25:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796364333] [2023-05-04 08:25:28,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:28,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-04 08:25:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-04 08:25:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-05-04 08:25:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:28,093 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.428571428571429) internal successors, (174), 14 states have internal predecessors, (174), 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 08:25:28,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:28,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:28,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:28,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:28,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:28,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:28,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:28,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 389665335, now seen corresponding path program 1 times [2023-05-04 08:25:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:28,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593588393] [2023-05-04 08:25:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:29,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:29,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593588393] [2023-05-04 08:25:29,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593588393] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:29,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719841800] [2023-05-04 08:25:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:29,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:29,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:29,684 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:29,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-04 08:25:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:29,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-04 08:25:29,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:29,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:30,074 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:30,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:30,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:30,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:30,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-05-04 08:25:30,407 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:25:30,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:25:30,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:30,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:25:30,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:25:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:30,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:30,797 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_697) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (not (= |c_t_funThread1of2ForFork0_~i~0#1| |c_t_funThread2of2ForFork0_~i~0#1|))) is different from false [2023-05-04 08:25:30,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2023-05-04 08:25:30,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:25:31,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2023-05-04 08:25:31,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (forall ((v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_697) |c_~#a~0.base|) .cse0) 0)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-05-04 08:25:33,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_697) |c_~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:25:33,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:25:33,515 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:25:33,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:25:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 19 not checked. [2023-05-04 08:25:33,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719841800] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:33,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:33,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2023-05-04 08:25:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669983162] [2023-05-04 08:25:33,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-05-04 08:25:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-05-04 08:25:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=737, Unknown=3, NotChecked=174, Total=1056 [2023-05-04 08:25:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:33,523 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:33,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.212121212121213) internal successors, (271), 33 states have internal predecessors, (271), 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 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:33,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:50,480 WARN L233 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:25:54,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:54,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 08:25:54,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1914753937, now seen corresponding path program 1 times [2023-05-04 08:25:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:54,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191131784] [2023-05-04 08:25:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-05-04 08:25:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:55,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191131784] [2023-05-04 08:25:55,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191131784] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:55,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253753039] [2023-05-04 08:25:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:55,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:55,233 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:55,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-05-04 08:25:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:55,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-04 08:25:55,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:55,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:55,665 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:55,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:55,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:55,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:55,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:55,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 08:25:56,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-05-04 08:25:56,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-04 08:25:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-05-04 08:25:56,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:58,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~post39#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:26:00,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:26:02,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:26:04,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) |c_t_funThread2of2ForFork0_#t~post36#1|) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:26:06,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) |c_t_funThread2of2ForFork0_#t~mem35#1|) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:26:06,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_801) |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:26:06,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:26:06,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-05-04 08:26:06,907 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:26:06,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:26:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 2 not checked. [2023-05-04 08:26:06,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253753039] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:26:06,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:26:06,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 35 [2023-05-04 08:26:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619303705] [2023-05-04 08:26:06,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:26:06,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-05-04 08:26:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:26:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-05-04 08:26:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=697, Unknown=6, NotChecked=354, Total=1190 [2023-05-04 08:26:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:26:06,913 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:26:06,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.028571428571428) internal successors, (281), 35 states have internal predecessors, (281), 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 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:26:06,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:26:17,045 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:26:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 08:26:34,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-05-04 08:26:34,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-04 08:26:34,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:26:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:26:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1162855945, now seen corresponding path program 2 times [2023-05-04 08:26:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:26:34,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461694302] [2023-05-04 08:26:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:26:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:26:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:26:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:26:35,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:26:35,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461694302] [2023-05-04 08:26:35,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461694302] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:26:35,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807612995] [2023-05-04 08:26:35,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:26:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:26:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:26:35,674 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:26:35,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-05-04 08:26:35,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:26:35,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:26:35,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 38 conjunts are in the unsatisfiable core [2023-05-04 08:26:35,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:26:35,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:26:36,205 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:26:36,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:26:36,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:26:36,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:26:36,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-05-04 08:26:36,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:26:36,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:26:36,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-05-04 08:26:36,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:26:37,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:26:37,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-05-04 08:26:37,070 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:26:37,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:26:37,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:26:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:26:37,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:26:37,279 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_895 Int)) (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_895) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)))) (forall ((v_ArrVal_897 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_897) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0)))) is different from false [2023-05-04 08:26:37,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:26:37,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-05-04 08:26:37,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:26:37,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-05-04 08:26:37,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-05-04 08:26:37,860 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_895 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_893 (Array Int Int))) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|) v_ArrVal_895) (+ .cse0 |~#a~0.offset|)) 0))))) is different from false [2023-05-04 08:26:51,617 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:26:51,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:26:51,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:26:53,717 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:26:53,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:26:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 11 not checked. [2023-05-04 08:26:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807612995] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:26:53,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:26:53,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 40 [2023-05-04 08:26:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198538795] [2023-05-04 08:26:53,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:26:53,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 08:26:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:26:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 08:26:53,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1145, Unknown=29, NotChecked=146, Total=1560 [2023-05-04 08:26:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:26:53,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:26:53,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.8) internal successors, (312), 40 states have internal predecessors, (312), 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 08:26:53,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:53,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:53,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:26:53,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:26:53,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:53,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:26:53,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:53,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:26:53,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 08:26:53,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:07,889 WARN L233 SmtUtils]: Spent 14.08s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 08:27:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:27:10,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:10,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:10,604 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash -642320529, now seen corresponding path program 2 times [2023-05-04 08:27:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:10,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849169781] [2023-05-04 08:27:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-05-04 08:27:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:11,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849169781] [2023-05-04 08:27:11,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849169781] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:11,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912998022] [2023-05-04 08:27:11,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:27:11,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:11,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:11,402 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:11,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-05-04 08:27:11,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:27:11,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:11,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-04 08:27:11,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:11,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:27:11,847 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:27:11,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:27:11,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:11,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:12,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 08:27:12,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-05-04 08:27:12,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2023-05-04 08:27:12,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-05-04 08:27:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-04 08:27:12,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:16,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~post39#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:27:18,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:27:20,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:27:22,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse0 (+ (- 1) (select (select |c_#memory_int| |c_~#a~0.base|) .cse0)))) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:27:24,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 (+ |c_t_funThread2of2ForFork0_#t~post36#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse0 |c_t_funThread2of2ForFork0_#t~post36#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-04 08:27:26,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= 0 (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 (+ |c_t_funThread2of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse0 |c_t_funThread2of2ForFork0_#t~mem35#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))))) is different from false [2023-05-04 08:27:28,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_1001 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse2 (select .cse0 .cse1))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse1 .cse2))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:27:30,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1001 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998))) (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse2 .cse3)))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:27:31,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:27:31,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2023-05-04 08:27:31,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 133 [2023-05-04 08:27:31,181 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:27:31,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:27:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 16 not checked. [2023-05-04 08:27:31,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912998022] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:31,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 38 [2023-05-04 08:27:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716795269] [2023-05-04 08:27:31,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:31,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-05-04 08:27:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-05-04 08:27:31,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=764, Unknown=8, NotChecked=504, Total=1406 [2023-05-04 08:27:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:31,193 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:31,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.31578947368421) internal successors, (316), 38 states have internal predecessors, (316), 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 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:31,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:31,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:27:31,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 08:27:31,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:27:31,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:27:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 08:27:39,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 08:27:39,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-05-04 08:27:39,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:39,595 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1] [2023-05-04 08:27:39,595 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2023-05-04 08:27:39,599 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:27:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:27:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:39,603 INFO L229 MonitoredProcess]: Starting monitored process 20 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 08:27:39,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2023-05-04 08:27:39,607 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:27:39,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 08:27:39,608 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;@4355cd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:27:39,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 08:27:39,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:39,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2114264243, now seen corresponding path program 1 times [2023-05-04 08:27:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:39,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526546735] [2023-05-04 08:27:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-05-04 08:27:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:39,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526546735] [2023-05-04 08:27:39,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526546735] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:39,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:27:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190763325] [2023-05-04 08:27:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:39,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:27:39,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:39,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:27:39,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:27:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:39,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:39,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 08:27:39,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:39,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-05-04 08:27:39,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash 362414810, now seen corresponding path program 1 times [2023-05-04 08:27:39,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:39,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879837691] [2023-05-04 08:27:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879837691] [2023-05-04 08:27:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879837691] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955493484] [2023-05-04 08:27:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:39,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:39,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:39,907 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:39,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-05-04 08:27:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:40,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:27:40,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:40,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:40,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955493484] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:40,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:40,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:27:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259098602] [2023-05-04 08:27:40,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:27:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:27:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:27:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:40,085 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 08:27:40,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:40,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-05-04 08:27:40,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1541037818, now seen corresponding path program 2 times [2023-05-04 08:27:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630428108] [2023-05-04 08:27:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-04 08:27:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630428108] [2023-05-04 08:27:40,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630428108] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:40,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:40,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:27:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707821941] [2023-05-04 08:27:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:40,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:27:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:40,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:27:40,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:27:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:40,505 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:40,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 08:27:40,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:40,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-05-04 08:27:40,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:40,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 107909962, now seen corresponding path program 3 times [2023-05-04 08:27:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:40,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440392064] [2023-05-04 08:27:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:40,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440392064] [2023-05-04 08:27:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440392064] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611160411] [2023-05-04 08:27:40,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:27:40,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:40,704 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:40,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-05-04 08:27:40,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 08:27:40,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:40,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 08:27:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:27:40,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:27:40,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611160411] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:40,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:40,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2023-05-04 08:27:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938782245] [2023-05-04 08:27:40,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 08:27:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 08:27:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-05-04 08:27:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:40,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:40,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.578947368421053) internal successors, (220), 19 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 08:27:40,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:40,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:40,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:27:41,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:41,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-05-04 08:27:41,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 705833280, now seen corresponding path program 1 times [2023-05-04 08:27:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:41,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670610201] [2023-05-04 08:27:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:27:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670610201] [2023-05-04 08:27:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670610201] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596905759] [2023-05-04 08:27:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:41,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:41,447 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:41,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-05-04 08:27:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:41,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 08:27:41,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:27:41,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:27:41,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596905759] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:41,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:41,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-05-04 08:27:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873457502] [2023-05-04 08:27:41,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:41,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-04 08:27:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-04 08:27:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-05-04 08:27:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:41,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:41,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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 08:27:41,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:41,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:41,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:41,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:27:41,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:27:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 08:27:41,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:42,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:42,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1214592147, now seen corresponding path program 2 times [2023-05-04 08:27:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:42,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202257305] [2023-05-04 08:27:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:27:42,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:42,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202257305] [2023-05-04 08:27:42,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202257305] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:42,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123439475] [2023-05-04 08:27:42,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:27:42,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:42,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:42,373 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:42,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-05-04 08:27:42,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:27:42,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:42,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2023-05-04 08:27:42,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:27:42,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:27:42,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123439475] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:42,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:42,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2023-05-04 08:27:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299004473] [2023-05-04 08:27:42,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:42,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:27:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:27:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:27:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:42,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:42,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 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 08:27:42,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:42,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:42,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:42,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:27:42,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-04 08:27:42,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:27:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-04 08:27:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:43,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:43,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:43,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 345089440, now seen corresponding path program 3 times [2023-05-04 08:27:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:43,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30412300] [2023-05-04 08:27:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:27:43,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 08:27:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:27:43,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 08:27:43,344 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 08:27:43,344 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 08:27:43,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-04 08:27:43,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-05-04 08:27:43,345 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1] [2023-05-04 08:27:43,345 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2023-05-04 08:27:43,346 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 08:27:43,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-05-04 08:27:43,368 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-04 08:27:43,371 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:27:43,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:27:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:43,386 INFO L229 MonitoredProcess]: Starting monitored process 25 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 08:27:43,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2023-05-04 08:27:43,448 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:27:43,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 08:27:43,451 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;@4355cd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:27:43,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 08:27:43,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 883447984, now seen corresponding path program 1 times [2023-05-04 08:27:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:43,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878269416] [2023-05-04 08:27:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:27:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:43,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878269416] [2023-05-04 08:27:43,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878269416] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:43,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:43,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 08:27:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588315111] [2023-05-04 08:27:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:43,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 08:27:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:43,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 08:27:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 08:27:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:43,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:43,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 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 08:27:43,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:44,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-05-04 08:27:44,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1602395689, now seen corresponding path program 1 times [2023-05-04 08:27:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:44,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515109619] [2023-05-04 08:27:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:45,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515109619] [2023-05-04 08:27:45,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515109619] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:45,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:45,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:27:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744839136] [2023-05-04 08:27:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:45,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:27:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:27:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:27:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:45,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:45,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 08:27:45,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:45,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:45,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-05-04 08:27:45,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash 4043947, now seen corresponding path program 1 times [2023-05-04 08:27:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756766191] [2023-05-04 08:27:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:45,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756766191] [2023-05-04 08:27:45,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756766191] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152891928] [2023-05-04 08:27:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:45,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:45,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:45,637 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:45,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-05-04 08:27:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:45,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:27:45,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:45,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:45,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152891928] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:45,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:45,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:27:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606460659] [2023-05-04 08:27:45,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:45,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:27:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:45,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:27:45,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:27:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:45,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:45,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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 08:27:45,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:45,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:45,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:46,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:46,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:46,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2068888427, now seen corresponding path program 2 times [2023-05-04 08:27:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:46,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914564056] [2023-05-04 08:27:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-04 08:27:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914564056] [2023-05-04 08:27:46,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914564056] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:46,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:46,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:27:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282545440] [2023-05-04 08:27:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:46,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:27:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:27:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:27:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:46,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:46,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 08:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:46,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:46,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-05-04 08:27:46,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:46,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -58909368, now seen corresponding path program 1 times [2023-05-04 08:27:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:46,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717542245] [2023-05-04 08:27:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:46,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717542245] [2023-05-04 08:27:46,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717542245] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:46,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652732753] [2023-05-04 08:27:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:46,803 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:46,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-05-04 08:27:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:46,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:27:46,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:46,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:47,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652732753] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:47,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:47,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 08:27:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95181763] [2023-05-04 08:27:47,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:47,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 08:27:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 08:27:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 08:27:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:47,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:47,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 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 08:27:47,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:47,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:47,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:47,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:47,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:47,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:47,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-05-04 08:27:47,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash -786859320, now seen corresponding path program 2 times [2023-05-04 08:27:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:47,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988498451] [2023-05-04 08:27:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988498451] [2023-05-04 08:27:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988498451] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440189506] [2023-05-04 08:27:47,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:27:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:47,620 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:47,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-05-04 08:27:47,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:27:47,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:47,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:27:47,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:47,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 08:27:48,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440189506] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:48,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:48,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:27:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011400458] [2023-05-04 08:27:48,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:48,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:27:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:48,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:27:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:27:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:48,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 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 08:27:48,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:48,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:48,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:48,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:48,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:48,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 286645958, now seen corresponding path program 3 times [2023-05-04 08:27:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:48,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989841081] [2023-05-04 08:27:48,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:27:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989841081] [2023-05-04 08:27:48,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989841081] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185414882] [2023-05-04 08:27:48,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:27:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:48,531 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:48,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-05-04 08:27:48,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 08:27:48,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:48,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 08:27:48,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:27:48,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:27:48,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185414882] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:48,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:48,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-05-04 08:27:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102143779] [2023-05-04 08:27:48,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:48,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-04 08:27:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-04 08:27:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-05-04 08:27:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:48,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.285714285714286) internal successors, (200), 14 states have internal predecessors, (200), 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 08:27:48,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:48,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:48,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:48,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-04 08:27:49,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-05-04 08:27:49,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:49,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:27:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 647877238, now seen corresponding path program 1 times [2023-05-04 08:27:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207234203] [2023-05-04 08:27:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:27:49,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 08:27:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:27:49,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 08:27:49,294 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 08:27:49,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 08:27:49,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-04 08:27:49,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-05-04 08:27:49,295 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2023-05-04 08:27:49,296 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2023-05-04 08:27:49,296 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 08:27:49,296 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-05-04 08:27:49,316 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-05-04 08:27:49,318 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:27:49,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:27:49,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:49,333 INFO L229 MonitoredProcess]: Starting monitored process 30 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 08:27:49,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2023-05-04 08:27:49,336 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:27:49,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2023-05-04 08:27:49,338 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;@4355cd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:27:49,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:27:49,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -79768482, now seen corresponding path program 1 times [2023-05-04 08:27:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:49,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344942774] [2023-05-04 08:27:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-05-04 08:27:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:49,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344942774] [2023-05-04 08:27:49,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344942774] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:49,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:49,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:27:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232768318] [2023-05-04 08:27:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:49,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:27:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:27:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:27:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:49,688 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:49,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 08:27:49,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:49,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-05-04 08:27:49,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1998931043, now seen corresponding path program 1 times [2023-05-04 08:27:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:49,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831071844] [2023-05-04 08:27:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831071844] [2023-05-04 08:27:49,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831071844] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268657399] [2023-05-04 08:27:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:49,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:49,901 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:49,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-05-04 08:27:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:50,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:27:50,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:50,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:50,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268657399] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:50,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:50,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:27:50,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753126650] [2023-05-04 08:27:50,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:50,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:27:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:27:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:27:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:50,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:50,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 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 08:27:50,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:50,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:50,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-05-04 08:27:50,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash 739053507, now seen corresponding path program 2 times [2023-05-04 08:27:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:50,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753198680] [2023-05-04 08:27:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-05-04 08:27:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:50,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753198680] [2023-05-04 08:27:50,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753198680] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:50,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:50,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:27:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500417739] [2023-05-04 08:27:50,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:50,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:27:50,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:27:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:27:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:50,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:50,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 08:27:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:50,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-05-04 08:27:50,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1011765648, now seen corresponding path program 1 times [2023-05-04 08:27:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:50,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741275993] [2023-05-04 08:27:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:50,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741275993] [2023-05-04 08:27:50,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741275993] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:50,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331047979] [2023-05-04 08:27:50,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:50,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:50,634 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:50,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-05-04 08:27:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:50,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:27:50,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:50,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:50,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331047979] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:50,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:50,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 08:27:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610833332] [2023-05-04 08:27:50,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:50,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 08:27:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 08:27:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 08:27:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:50,904 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:50,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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 08:27:50,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:50,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:50,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:51,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-05-04 08:27:51,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-05-04 08:27:51,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -768971472, now seen corresponding path program 2 times [2023-05-04 08:27:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:51,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563852733] [2023-05-04 08:27:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563852733] [2023-05-04 08:27:51,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563852733] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044086510] [2023-05-04 08:27:51,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:27:51,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:51,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:51,564 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:51,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-05-04 08:27:51,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:27:51,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:51,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:27:51,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:51,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-04 08:27:51,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044086510] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:51,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:51,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:27:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025208351] [2023-05-04 08:27:51,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:51,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:27:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:27:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:27:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:51,997 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:51,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.521739130434783) internal successors, (196), 23 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:27:51,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:51,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:51,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:51,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:51,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:52,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-05-04 08:27:52,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-05-04 08:27:52,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1373985681, now seen corresponding path program 3 times [2023-05-04 08:27:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:52,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923810572] [2023-05-04 08:27:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-05-04 08:27:52,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:52,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923810572] [2023-05-04 08:27:52,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923810572] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:27:52,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:27:52,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 08:27:52,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793905565] [2023-05-04 08:27:52,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:27:52,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 08:27:52,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:52,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 08:27:52,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-05-04 08:27:52,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:52,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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 08:27:52,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:52,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:52,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:52,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:52,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:52,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:27:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:27:52,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-05-04 08:27:52,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:27:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:27:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash -117270506, now seen corresponding path program 1 times [2023-05-04 08:27:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:27:52,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372008308] [2023-05-04 08:27:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:27:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-04 08:27:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:54,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372008308] [2023-05-04 08:27:54,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372008308] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:54,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381521827] [2023-05-04 08:27:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:54,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:54,030 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:54,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-05-04 08:27:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:54,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 50 conjunts are in the unsatisfiable core [2023-05-04 08:27:54,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:54,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:27:54,693 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:27:54,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:27:54,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:54,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:55,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:55,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:55,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-05-04 08:27:55,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:55,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:27:55,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-05-04 08:27:55,764 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:27:55,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:27:55,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:27:55,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:27:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-04 08:27:55,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:56,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2248) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2249) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-05-04 08:27:56,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:27:56,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-05-04 08:27:56,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:27:56,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-05-04 08:27:56,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-05-04 08:27:56,502 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (let ((.cse0 (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) .cse1 v_ArrVal_2249) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) .cse0) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int)) (let ((.cse2 (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) .cse1 v_ArrVal_2249) .cse2) 0) (= .cse2 |c_t_funThread3of4ForFork0_~p~0#1.offset|))))))) is different from false [2023-05-04 08:27:56,528 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2249 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2249) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2249 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2249) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-04 08:28:11,071 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:28:11,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2249 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2249) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-05-04 08:28:17,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:17,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:28:19,072 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:28:19,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:28:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 66 not checked. [2023-05-04 08:28:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381521827] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:28:19,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:28:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 49 [2023-05-04 08:28:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716352260] [2023-05-04 08:28:19,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:28:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-04 08:28:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:28:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-04 08:28:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1681, Unknown=9, NotChecked=356, Total=2352 [2023-05-04 08:28:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:28:19,085 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:28:19,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 9.10204081632653) internal successors, (446), 49 states have internal predecessors, (446), 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 08:28:19,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:28:19,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:28:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:28:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:28:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:28:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:28:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:28:29,285 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:28:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:28:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:28:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:28:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:28:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:28:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:28:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-05-04 08:28:30,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-05-04 08:28:30,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-05-04 08:28:30,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:28:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:28:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1050224952, now seen corresponding path program 1 times [2023-05-04 08:28:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:28:30,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434797434] [2023-05-04 08:28:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:28:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:28:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:28:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-04 08:28:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:28:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434797434] [2023-05-04 08:28:31,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434797434] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:28:31,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512688330] [2023-05-04 08:28:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:28:31,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:28:31,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:28:31,197 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:28:31,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-05-04 08:28:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:28:31,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 48 conjunts are in the unsatisfiable core [2023-05-04 08:28:31,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:28:31,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:28:31,736 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:28:31,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:28:31,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:28:31,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:28:31,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:28:32,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:28:32,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:28:32,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 08:28:32,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-05-04 08:28:32,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-04 08:28:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2023-05-04 08:28:32,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:28:42,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread3of4ForFork0_#t~post39#1|)) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-04 08:28:44,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) (+ |c_t_funThread3of4ForFork0_#t~mem38#1| (- 1))) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-04 08:28:46,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-04 08:28:48,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) |c_t_funThread3of4ForFork0_#t~post36#1|) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-04 08:28:50,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) |c_t_funThread3of4ForFork0_#t~mem35#1|) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-04 08:29:00,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2378 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2378) |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:29:03,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:29:03,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-05-04 08:29:03,574 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:29:03,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:29:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 4 not checked. [2023-05-04 08:29:03,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512688330] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:29:03,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:29:03,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 45 [2023-05-04 08:29:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145473419] [2023-05-04 08:29:03,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:29:03,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-05-04 08:29:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:29:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-05-04 08:29:03,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1276, Unknown=10, NotChecked=474, Total=1980 [2023-05-04 08:29:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:29:03,580 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:29:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.28888888888889) internal successors, (463), 45 states have internal predecessors, (463), 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 08:29:03,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-05-04 08:29:03,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:29:34,085 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 66 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:30:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:30:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:30:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-04 08:30:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-05-04 08:30:00,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-05-04 08:30:00,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:30:00,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:30:00,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:30:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -188831684, now seen corresponding path program 2 times [2023-05-04 08:30:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:30:00,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577943660] [2023-05-04 08:30:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:30:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:30:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-04 08:30:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:30:02,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577943660] [2023-05-04 08:30:02,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577943660] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:30:02,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244287438] [2023-05-04 08:30:02,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:30:02,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:30:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:30:02,433 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:30:02,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-05-04 08:30:02,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:30:02,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:30:02,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 56 conjunts are in the unsatisfiable core [2023-05-04 08:30:02,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:30:02,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:30:03,027 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:30:03,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:30:03,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:03,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:03,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 08:30:03,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:03,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:03,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:30:03,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:03,764 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-05-04 08:30:03,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-05-04 08:30:03,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:04,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:04,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-04 08:30:04,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:04,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-04 08:30:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:04,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-04 08:30:04,797 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:30:04,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:30:04,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:30:04,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:30:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-04 08:30:05,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:30:05,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_2504 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2504) (+ .cse0 |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2502 Int)) (not (= (select (select (let ((.cse1 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2501))) (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2502))) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)))))) is different from false [2023-05-04 08:30:06,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2502 Int) (v_ArrVal_2495 (Array Int Int)) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_2504 Int)) (let ((.cse5 (* |t_funThread3of4ForFork0_~i~0#1| 28)) (.cse1 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2495))) (let ((.cse2 (select .cse1 |c_~#a~0.base|)) (.cse3 (+ .cse5 4 |~#a~0.offset|)) (.cse4 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (not (= (select (select (let ((.cse0 (store (store .cse1 |c_~#a~0.base| (store .cse2 .cse3 1)) |c_~#__global_lock~0.base| v_ArrVal_2501))) (store .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2502))) |c_~#a~0.base|) (+ .cse4 4 |~#a~0.offset|)) 0)) (not (= (select .cse2 .cse3) 0)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2499) |c_~#a~0.base|) (+ .cse5 |~#a~0.offset|) v_ArrVal_2504) (+ .cse4 |~#a~0.offset|)) 0))))) is different from false [2023-05-04 08:30:06,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:30:06,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 94 [2023-05-04 08:30:06,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:30:06,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5563 treesize of output 5471 [2023-05-04 08:30:06,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6510 treesize of output 5698 [2023-05-04 08:30:06,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:30:06,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6223 treesize of output 5920 [2023-05-04 08:30:06,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-04 08:30:06,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:30:06,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 223 [2023-05-04 08:30:08,931 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2499 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_2504 Int)) (let ((.cse1 (* |t_funThread3of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2499) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|) v_ArrVal_2504) (+ .cse0 |~#a~0.offset|)) 0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2499 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_2504 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2499) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2504) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-04 08:30:20,444 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:30:20,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-05-04 08:30:20,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:30:20,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:30:24,553 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:30:24,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:30:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 239 trivial. 64 not checked. [2023-05-04 08:30:24,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244287438] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:30:24,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:30:24,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 23] total 58 [2023-05-04 08:30:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573677582] [2023-05-04 08:30:24,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:30:24,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-04 08:30:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:30:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-04 08:30:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2624, Unknown=13, NotChecked=324, Total=3306 [2023-05-04 08:30:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:30:24,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:30:24,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 8.241379310344827) internal successors, (478), 58 states have internal predecessors, (478), 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 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:30:24,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-04 08:30:24,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-05-04 08:30:24,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:30:46,785 WARN L233 SmtUtils]: Spent 22.09s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-04 08:30:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-04 08:30:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 08:30:54,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-05-04 08:30:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-05-04 08:30:55,171 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:30:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:30:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1235736660, now seen corresponding path program 3 times [2023-05-04 08:30:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:30:55,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350608928] [2023-05-04 08:30:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:30:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:30:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-04 08:30:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:30:56,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350608928] [2023-05-04 08:30:56,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350608928] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:30:56,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247471276] [2023-05-04 08:30:56,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:30:56,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:30:56,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:30:56,956 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:30:56,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-05-04 08:30:57,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-05-04 08:30:57,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:30:57,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 57 conjunts are in the unsatisfiable core [2023-05-04 08:30:57,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:30:57,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:30:57,914 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:30:57,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:30:57,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:58,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:58,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 08:30:58,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:58,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:58,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:30:58,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:58,425 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-05-04 08:30:58,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-05-04 08:30:58,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:59,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:59,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-04 08:30:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:59,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-04 08:30:59,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:59,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-04 08:30:59,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:30:59,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:30:59,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-05-04 08:30:59,403 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:30:59,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:30:59,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:30:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-04 08:30:59,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:30:59,600 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2628 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2628) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2629) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-05-04 08:30:59,607 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2628 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2628) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2629 (Array Int Int)) (v_ArrVal_2626 Int)) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2626)) |c_~#__global_lock~0.base| v_ArrVal_2629) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-05-04 08:31:00,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:31:00,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 97 [2023-05-04 08:31:00,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:31:00,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20347 treesize of output 20151 [2023-05-04 08:31:00,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20102 treesize of output 17190 [2023-05-04 08:31:01,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18278 treesize of output 17102 [2023-05-04 08:31:01,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:31:01,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25035 treesize of output 23556 [2023-05-04 08:31:01,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-04 08:31:01,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:31:01,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 223 [2023-05-04 08:31:01,773 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2628) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)))) (.cse1 (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse3 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse2 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ .cse2 |~#a~0.offset|) v_ArrVal_2628) (+ .cse3 |~#a~0.offset|)) 0) (= .cse3 .cse2)))))) (and (or (and .cse0 .cse1) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) .cse0 .cse1)) is different from false [2023-05-04 08:31:03,901 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2628) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0))) (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2628) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0))))) is different from false [2023-05-04 08:31:11,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:31:11,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:31:11,197 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:31:13,266 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:31:13,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:31:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 47 not checked. [2023-05-04 08:31:13,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247471276] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:31:13,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:31:13,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 25] total 62 [2023-05-04 08:31:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755033961] [2023-05-04 08:31:13,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:31:13,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-05-04 08:31:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:31:13,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-05-04 08:31:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2885, Unknown=27, NotChecked=460, Total=3782 [2023-05-04 08:31:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:31:13,281 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:31:13,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 7.82258064516129) internal successors, (485), 62 states have internal predecessors, (485), 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 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-04 08:31:13,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-04 08:31:13,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-04 08:31:13,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:31:27,460 WARN L233 SmtUtils]: Spent 14.08s on a formula simplification. DAG size of input: 46 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:31:47,921 WARN L233 SmtUtils]: Spent 20.07s on a formula simplification. DAG size of input: 42 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:32:12,157 WARN L233 SmtUtils]: Spent 22.15s on a formula simplification. DAG size of input: 47 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:32:32,712 WARN L233 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 64 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:33:05,444 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 52 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:33:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 08:33:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-05-04 08:33:12,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-05-04 08:33:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:33:13,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:33:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:33:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1847986836, now seen corresponding path program 2 times [2023-05-04 08:33:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:33:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366468089] [2023-05-04 08:33:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:33:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:33:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:33:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2023-05-04 08:33:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:33:13,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366468089] [2023-05-04 08:33:13,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366468089] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:33:13,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495797194] [2023-05-04 08:33:13,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:33:13,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:33:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:33:13,806 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:33:13,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-05-04 08:33:14,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:33:14,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:33:14,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 46 conjunts are in the unsatisfiable core [2023-05-04 08:33:14,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:33:14,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:33:14,423 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:33:14,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:33:14,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:33:14,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:33:14,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:33:14,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:33:14,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-05-04 08:33:15,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:33:15,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-05-04 08:33:15,283 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:33:15,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:33:15,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:33:15,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-05-04 08:33:15,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-05-04 08:33:15,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:33:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-04 08:33:15,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:33:15,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2764) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-04 08:33:15,865 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse0 v_ArrVal_2764)) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (= |c_t_funThread1of4ForFork0___VERIFIER_assert_#in~cond#1| 0) (forall ((v_ArrVal_2759 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2759) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-05-04 08:33:15,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_2759 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2759) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))) (forall ((v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764)) (+ .cse0 |c_~#a~0.offset|)) 0))))) is different from false [2023-05-04 08:33:15,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:33:15,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-05-04 08:33:15,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:33:15,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-05-04 08:33:15,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-05-04 08:33:15,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (let ((.cse3 (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)))) (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (let ((.cse2 (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764) .cse2) 0) (= .cse2 |c_t_funThread3of4ForFork0_~p~0#1.offset|)))) (or .cse3 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (or .cse3 (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))))) is different from false [2023-05-04 08:33:16,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse1 (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764)) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0))) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse4 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse3 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse2 (+ .cse3 |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse2 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse2 v_ArrVal_2764)) (+ .cse4 |~#a~0.offset|)) 0) (= .cse4 .cse3)))))) is different from false [2023-05-04 08:33:16,091 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2756 (Array Int Int)) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse1 (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2756))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) .cse1 v_ArrVal_2761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764)) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2756 (Array Int Int)) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse5 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse4 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse3 (+ .cse4 |~#a~0.offset|))) (store (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2756))) (store .cse2 |c_~#a~0.base| (store (select .cse2 |c_~#a~0.base|) .cse3 v_ArrVal_2761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse3 v_ArrVal_2764)) (+ .cse5 |~#a~0.offset|)) 0) (= .cse5 .cse4))))) is different from false [2023-05-04 08:33:24,590 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:33:35,866 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:33:35,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2023-05-04 08:33:35,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:33:35,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-05-04 08:33:35,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:33:37,971 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:33:37,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:33:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 38 not checked. [2023-05-04 08:33:37,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495797194] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:33:37,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:33:37,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 45 [2023-05-04 08:33:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700570402] [2023-05-04 08:33:37,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:33:37,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-05-04 08:33:37,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:33:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-05-04 08:33:37,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1284, Unknown=17, NotChecked=474, Total=1980 [2023-05-04 08:33:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:33:37,985 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:33:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.2) internal successors, (459), 45 states have internal predecessors, (459), 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 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-05-04 08:33:37,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:34:03,128 WARN L233 SmtUtils]: Spent 25.03s on a formula simplification. DAG size of input: 47 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:34:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:34:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:34:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:34:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:34:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-05-04 08:34:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 08:34:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-05-04 08:34:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:34:31,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-05-04 08:34:31,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-05-04 08:34:31,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:34:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:34:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1002877638, now seen corresponding path program 1 times [2023-05-04 08:34:31,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:34:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923789162] [2023-05-04 08:34:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:34:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:34:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:34:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-05-04 08:34:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:34:31,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923789162] [2023-05-04 08:34:31,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923789162] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:34:31,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944959679] [2023-05-04 08:34:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:34:31,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:34:31,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:34:31,944 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:34:31,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-05-04 08:34:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:34:32,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 08:34:32,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:34:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-05-04 08:34:32,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:34:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-05-04 08:34:32,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944959679] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:34:32,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:34:32,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-05-04 08:34:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401502687] [2023-05-04 08:34:32,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:34:32,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-04 08:34:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:34:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-04 08:34:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-05-04 08:34:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:34:32,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:34:32,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.772727272727273) internal successors, (303), 22 states have internal predecessors, (303), 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 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:34:32,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:34:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2023-05-04 08:34:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:34:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-05-04 08:34:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:34:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 08:34:48,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-05-04 08:34:48,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-05-04 08:34:48,965 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:34:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:34:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 143598486, now seen corresponding path program 4 times [2023-05-04 08:34:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:34:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720737835] [2023-05-04 08:34:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:34:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:34:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:34:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-04 08:34:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:34:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720737835] [2023-05-04 08:34:50,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720737835] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:34:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072617278] [2023-05-04 08:34:50,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 08:34:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:34:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:34:50,731 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:34:50,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-05-04 08:34:51,034 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 08:34:51,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:34:51,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 55 conjunts are in the unsatisfiable core [2023-05-04 08:34:51,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:34:51,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:34:51,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:34:51,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:34:51,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:51,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:51,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 08:34:51,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:52,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:34:52,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:34:52,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:52,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:52,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:34:52,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:34:52,791 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-05-04 08:34:52,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-05-04 08:34:52,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:34:52,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-04 08:34:52,943 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:34:52,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:34:53,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:34:53,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:34:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-04 08:34:53,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:34:53,316 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3004 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_3004) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3002 Int)) (let ((.cse1 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse2 (select .cse1 |c_t_funThread4of4ForFork0_~p~0#1.base|)) (.cse3 (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select (select (let ((.cse0 (store .cse1 |c_t_funThread4of4ForFork0_~p~0#1.base| (store .cse2 .cse3 1)))) (store .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)) 0)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2023-05-04 08:34:53,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_3004 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_3004) (+ .cse0 |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3002 Int)) (let ((.cse4 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse1 (select .cse4 |c_~#a~0.base|)) (.cse2 (+ .cse0 |c_~#a~0.offset| 4))) (or (not (= (select .cse1 .cse2) 0)) (not (= (select (select (let ((.cse3 (store .cse4 |c_~#a~0.base| (store .cse1 .cse2 1)))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)) 0))))))))) is different from false [2023-05-04 08:34:53,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_3004 Int) (v_ArrVal_3002 Int)) (let ((.cse4 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse3 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse0 (select .cse3 |c_~#a~0.base|)) (.cse1 (+ .cse4 |c_~#a~0.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (let ((.cse2 (store .cse3 |c_~#a~0.base| (store .cse0 .cse1 1)))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_3004) (+ .cse4 |c_~#a~0.offset|)) 0))))) is different from false [2023-05-04 08:34:53,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_3002 Int)) (let ((.cse5 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse1 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse4 (* |t_funThread3of4ForFork0_~i~0#1| 28)) (.cse2 (select .cse1 |c_~#a~0.base|)) (.cse3 (+ .cse5 4 |~#a~0.offset|))) (or (not (= 0 (select (select (let ((.cse0 (store .cse1 |c_~#a~0.base| (store .cse2 .cse3 1)))) (store .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_~#a~0.base|) (+ .cse4 4 |~#a~0.offset|)))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse4 |~#a~0.offset|) v_ArrVal_3004) (+ .cse5 |~#a~0.offset|)) 0) (not (= (select .cse2 .cse3) 0)))))) is different from false [2023-05-04 08:34:54,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:34:54,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 88 [2023-05-04 08:34:54,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:34:54,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1011 treesize of output 983 [2023-05-04 08:34:54,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:34:54,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1499 treesize of output 1364 [2023-05-04 08:34:54,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-04 08:34:54,424 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-05-04 08:34:54,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 153 [2023-05-04 08:34:54,523 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_3004) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0))))) is different from false [2023-05-04 08:34:56,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_3004) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-04 08:34:56,653 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t_funThread1of4ForFork0_assume_abort_if_not_~cond#1| 0) (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_3004) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-05-04 08:35:04,930 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 31 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:35:04,953 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-05-04 08:35:13,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:35:13,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:35:15,328 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:35:15,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:35:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 68 not checked. [2023-05-04 08:35:15,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072617278] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:35:15,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:35:15,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 24] total 59 [2023-05-04 08:35:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939162040] [2023-05-04 08:35:15,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:35:15,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-05-04 08:35:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:35:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-05-04 08:35:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2227, Unknown=20, NotChecked=840, Total=3422 [2023-05-04 08:35:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:35:15,340 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:35:15,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 8.084745762711865) internal successors, (477), 59 states have internal predecessors, (477), 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 08:35:15,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:35:15,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:35:15,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:35:15,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:35:15,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:35:15,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 08:35:15,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:36:07,955 WARN L233 SmtUtils]: Spent 52.24s on a formula simplification. DAG size of input: 49 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:36:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2023-05-04 08:36:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:36:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-05-04 08:36:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:36:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 08:36:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-05-04 08:36:21,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-05-04 08:36:21,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-05-04 08:36:21,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:36:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:36:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1714709394, now seen corresponding path program 5 times [2023-05-04 08:36:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:36:21,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301391800] [2023-05-04 08:36:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:36:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:36:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:36:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-04 08:36:23,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:36:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301391800] [2023-05-04 08:36:23,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301391800] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:36:23,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352170780] [2023-05-04 08:36:23,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-04 08:36:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:36:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:36:23,073 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:36:23,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-05-04 08:36:24,074 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-05-04 08:36:24,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:36:24,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 08:36:24,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:36:24,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:36:24,341 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:36:24,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:36:24,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:24,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:24,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:24,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:24,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:25,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-05-04 08:36:25,218 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-04 08:36:25,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-04 08:36:25,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-04 08:36:25,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 08:36:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-04 08:36:25,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:36:25,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-05-04 08:36:29,854 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_3116 (Array Int Int))) (let ((.cse0 (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3116) |c_~#a~0.base|) .cse0) 0) (= .cse0 |c_t_funThread3of4ForFork0_~p~0#1.offset|)))) (= (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) is different from false [2023-05-04 08:36:29,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (|~#a~0.offset| Int) (v_ArrVal_3116 (Array Int Int))) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3116) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0) (= .cse0 (* |c_t_funThread3of4ForFork0_~i~0#1| 28))))) is different from false [2023-05-04 08:36:30,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_3116 (Array Int Int)) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3116) |c_~#a~0.base|) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-04 08:36:30,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-05-04 08:36:30,558 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:36:30,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:36:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 38 not checked. [2023-05-04 08:36:30,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352170780] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:36:30,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:36:30,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 41 [2023-05-04 08:36:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194755346] [2023-05-04 08:36:30,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:36:30,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-04 08:36:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:36:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-04 08:36:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1230, Unknown=6, NotChecked=222, Total=1640 [2023-05-04 08:36:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:36:30,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:36:30,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.414634146341463) internal successors, (386), 41 states have internal predecessors, (386), 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 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2023-05-04 08:36:30,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:36:38,788 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:47,079 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 46 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-05-04 08:36:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-04 08:36:59,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-05-04 08:36:59,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-05-04 08:36:59,561 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:36:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:36:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1857624964, now seen corresponding path program 6 times [2023-05-04 08:36:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:36:59,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460724349] [2023-05-04 08:36:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:36:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:36:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat