/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 ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 01:07:29,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 01:07:29,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 01:07:29,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 01:07:29,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 01:07:29,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 01:07:29,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 01:07:29,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 01:07:29,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 01:07:29,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 01:07:29,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 01:07:29,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 01:07:29,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 01:07:29,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 01:07:29,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 01:07:29,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 01:07:29,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 01:07:29,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 01:07:29,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 01:07:29,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 01:07:29,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 01:07:29,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 01:07:29,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 01:07:29,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 01:07:29,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 01:07:29,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 01:07:29,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 01:07:29,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 01:07:29,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 01:07:29,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 01:07:29,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 01:07:29,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 01:07:29,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 01:07:29,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 01:07:29,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 01:07:29,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 01:07:29,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 01:07:29,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 01:07:29,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 01:07:29,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 01:07:29,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 01:07:29,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 01:07:30,012 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 01:07:30,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 01:07:30,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 01:07:30,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 01:07:30,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 01:07:30,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 01:07:30,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 01:07:30,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 01:07:30,014 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 01:07:30,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 01:07:30,015 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 01:07:30,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 01:07:30,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 01:07:30,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 01:07:30,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 01:07:30,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 01:07:30,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 01:07:30,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 01:07:30,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 01:07:30,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 01:07:30,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 01:07:30,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 01:07:30,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 01:07:30,018 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 01:07:30,018 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 -> ALL_READ_WRITE [2023-05-20 01:07:30,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 01:07:30,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 01:07:30,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 01:07:30,197 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 01:07:30,198 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 01:07:30,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-05-20 01:07:30,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1197bd3a/430d41d0e65b4359b93c2421b0dae572/FLAGcb1db269e [2023-05-20 01:07:30,712 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 01:07:30,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-05-20 01:07:30,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1197bd3a/430d41d0e65b4359b93c2421b0dae572/FLAGcb1db269e [2023-05-20 01:07:31,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1197bd3a/430d41d0e65b4359b93c2421b0dae572 [2023-05-20 01:07:31,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 01:07:31,234 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 01:07:31,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 01:07:31,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 01:07:31,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 01:07:31,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a07902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31, skipping insertion in model container [2023-05-20 01:07:31,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 01:07:31,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 01:07:31,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2023-05-20 01:07:31,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2023-05-20 01:07:31,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2023-05-20 01:07:31,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 01:07:31,752 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 01:07:31,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2023-05-20 01:07:31,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2023-05-20 01:07:31,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2023-05-20 01:07:31,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 01:07:31,863 INFO L208 MainTranslator]: Completed translation [2023-05-20 01:07:31,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31 WrapperNode [2023-05-20 01:07:31,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 01:07:31,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 01:07:31,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 01:07:31,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 01:07:31,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,965 INFO L138 Inliner]: procedures = 489, calls = 127, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1715 [2023-05-20 01:07:31,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 01:07:31,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 01:07:31,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 01:07:31,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 01:07:31,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:31,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:32,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:32,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:32,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:32,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:32,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 01:07:32,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 01:07:32,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 01:07:32,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 01:07:32,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (1/1) ... [2023-05-20 01:07:32,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 01:07:32,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:32,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 01:07:32,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 01:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-05-20 01:07:32,105 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-05-20 01:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 01:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 01:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 01:07:32,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 01:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 01:07:32,108 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 01:07:32,412 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 01:07:32,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 01:07:33,596 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 01:07:33,840 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 01:07:33,840 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2023-05-20 01:07:33,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 01:07:33 BoogieIcfgContainer [2023-05-20 01:07:33,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 01:07:33,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 01:07:33,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 01:07:33,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 01:07:33,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 01:07:31" (1/3) ... [2023-05-20 01:07:33,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5936d76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 01:07:33, skipping insertion in model container [2023-05-20 01:07:33,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 01:07:31" (2/3) ... [2023-05-20 01:07:33,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5936d76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 01:07:33, skipping insertion in model container [2023-05-20 01:07:33,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 01:07:33" (3/3) ... [2023-05-20 01:07:33,850 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-05-20 01:07:33,857 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 01:07:33,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 01:07:33,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-05-20 01:07:33,864 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 01:07:33,998 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-20 01:07:34,052 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 01:07:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 01:07:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:34,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 01:07:34,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 01:07:34,095 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 01:07:34,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 01:07:34,115 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;@357d24f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 01:07:34,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-05-20 01:07:34,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1244363970, now seen corresponding path program 1 times [2023-05-20 01:07:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:34,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555757980] [2023-05-20 01:07:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 01:07:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:34,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555757980] [2023-05-20 01:07:34,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555757980] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:34,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 01:07:34,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 01:07:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250650044] [2023-05-20 01:07:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:34,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 01:07:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 01:07:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 01:07:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:34,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:34,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:34,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:34,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 01:07:34,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1394094451, now seen corresponding path program 1 times [2023-05-20 01:07:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:34,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706854539] [2023-05-20 01:07:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-20 01:07:35,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:35,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706854539] [2023-05-20 01:07:35,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706854539] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:35,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 01:07:35,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 01:07:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811053186] [2023-05-20 01:07:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:35,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:07:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:07:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 01:07:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:35,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:35,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:35,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:35,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:35,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 01:07:35,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash 752504048, now seen corresponding path program 1 times [2023-05-20 01:07:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:35,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468961146] [2023-05-20 01:07:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2023-05-20 01:07:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:36,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468961146] [2023-05-20 01:07:36,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468961146] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:07:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810108386] [2023-05-20 01:07:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:36,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:36,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:07:36,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 01:07:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:37,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 3232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-20 01:07:37,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:07:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-20 01:07:37,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:07:37,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810108386] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:37,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:07:37,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-20 01:07:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995111332] [2023-05-20 01:07:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:37,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:07:37,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:37,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:07:37,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 01:07:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:37,184 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:37,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:37,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:37,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:37,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:37,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 01:07:37,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-20 01:07:37,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash -830802700, now seen corresponding path program 1 times [2023-05-20 01:07:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:37,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489956383] [2023-05-20 01:07:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-05-20 01:07:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489956383] [2023-05-20 01:07:38,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489956383] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:07:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395020458] [2023-05-20 01:07:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:38,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:38,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:38,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:07:38,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 01:07:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:39,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 3650 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-20 01:07:39,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:07:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-05-20 01:07:39,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:07:39,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395020458] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:39,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:07:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-20 01:07:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745279541] [2023-05-20 01:07:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:39,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:07:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:07:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 01:07:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:39,169 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:39,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:39,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:46,260 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-20 01:07:46,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:46,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash -758007713, now seen corresponding path program 1 times [2023-05-20 01:07:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:46,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391714789] [2023-05-20 01:07:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-20 01:07:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:47,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391714789] [2023-05-20 01:07:47,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391714789] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:07:47,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168427621] [2023-05-20 01:07:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:47,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:07:47,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 01:07:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:48,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 3562 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 01:07:48,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:07:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-20 01:07:48,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 01:07:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-20 01:07:48,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168427621] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 01:07:48,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 01:07:48,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 01:07:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713405318] [2023-05-20 01:07:48,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 01:07:48,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 01:07:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 01:07:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 01:07:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:48,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:48,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:48,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:48,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:48,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:48,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:48,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:07:48,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 01:07:48,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:48,717 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1390433335, now seen corresponding path program 2 times [2023-05-20 01:07:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949981911] [2023-05-20 01:07:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-05-20 01:07:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949981911] [2023-05-20 01:07:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949981911] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:07:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751322482] [2023-05-20 01:07:49,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 01:07:49,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:49,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:49,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:07:49,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-20 01:07:50,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-20 01:07:50,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 01:07:50,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 01:07:50,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:07:50,113 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 9 [2023-05-20 01:07:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-05-20 01:07:50,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:07:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751322482] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:07:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-05-20 01:07:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10192663] [2023-05-20 01:07:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-20 01:07:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-20 01:07:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-05-20 01:07:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:50,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:50,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 197.2) internal successors, (986), 5 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:07:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:07:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 01:07:50,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-20 01:07:50,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:50,829 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash -686245677, now seen corresponding path program 1 times [2023-05-20 01:07:50,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:50,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587481850] [2023-05-20 01:07:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:50,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2023-05-20 01:07:51,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587481850] [2023-05-20 01:07:51,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587481850] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:07:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722056587] [2023-05-20 01:07:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:51,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:07:51,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 01:07:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:52,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 3776 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 01:07:52,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:07:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-05-20 01:07:52,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 01:07:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-05-20 01:07:52,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722056587] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 01:07:52,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 01:07:52,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 11 [2023-05-20 01:07:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8923288] [2023-05-20 01:07:52,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 01:07:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-20 01:07:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-20 01:07:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-05-20 01:07:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:52,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:52,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.27272727272727) internal successors, (1092), 11 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 01:07:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:07:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 01:07:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 01:07:52,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-20 01:07:52,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:52,965 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1994662843, now seen corresponding path program 1 times [2023-05-20 01:07:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:52,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110524102] [2023-05-20 01:07:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 01:07:53,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 01:07:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 01:07:53,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 01:07:53,077 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 01:07:53,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-05-20 01:07:53,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-05-20 01:07:53,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-05-20 01:07:53,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-05-20 01:07:53,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-05-20 01:07:53,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-05-20 01:07:53,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-20 01:07:53,085 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-05-20 01:07:53,087 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-20 01:07:53,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-20 01:07:53,147 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 01:07:53,157 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 01:07:53,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 01:07:53,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:53,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 01:07:53,164 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 01:07:53,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 01:07:53,170 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;@357d24f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 01:07:53,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-05-20 01:07:53,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-05-20 01:07:53,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash 122283950, now seen corresponding path program 1 times [2023-05-20 01:07:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:53,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353312320] [2023-05-20 01:07:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 01:07:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353312320] [2023-05-20 01:07:53,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353312320] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:53,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 01:07:53,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 01:07:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515129473] [2023-05-20 01:07:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:53,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 01:07:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 01:07:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 01:07:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:53,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:53,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 252.5) internal successors, (505), 2 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:53,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:53,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-20 01:07:53,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2027616088, now seen corresponding path program 1 times [2023-05-20 01:07:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:53,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100103549] [2023-05-20 01:07:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:53,693 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-20 01:07:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100103549] [2023-05-20 01:07:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100103549] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:53,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 01:07:53,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 01:07:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538249627] [2023-05-20 01:07:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:53,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:07:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:07:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 01:07:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:53,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:53,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:53,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:53,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:56,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-20 01:07:56,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:07:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:07:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1153304715, now seen corresponding path program 1 times [2023-05-20 01:07:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:07:56,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565711515] [2023-05-20 01:07:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:07:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-05-20 01:07:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:07:57,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565711515] [2023-05-20 01:07:57,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565711515] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:07:57,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855049260] [2023-05-20 01:07:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:07:57,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:07:57,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:07:57,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:07:57,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-20 01:07:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:07:58,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 4051 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-20 01:07:58,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:07:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2023-05-20 01:07:58,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:07:58,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855049260] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:07:58,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:07:58,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-20 01:07:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449786449] [2023-05-20 01:07:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:07:58,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:07:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:07:58,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:07:58,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 01:07:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:58,685 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:07:58,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:07:58,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:07:58,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:07:58,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:00,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-20 01:08:00,333 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,SelfDestructingSolverStorable10 [2023-05-20 01:08:00,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:00,334 INFO L85 PathProgramCache]: Analyzing trace with hash -779845161, now seen corresponding path program 1 times [2023-05-20 01:08:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:00,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080279998] [2023-05-20 01:08:00,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:00,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:00,436 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-20 01:08:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080279998] [2023-05-20 01:08:00,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080279998] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:08:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273445614] [2023-05-20 01:08:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:08:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:08:00,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:08:00,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-20 01:08:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:00,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-20 01:08:00,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:08:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 01:08:00,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:08:00,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273445614] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:08:00,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:08:00,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-20 01:08:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069056325] [2023-05-20 01:08:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:08:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:08:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:00,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:08:00,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 01:08:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:00,852 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:00,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 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-20 01:08:00,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:00,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:00,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:00,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:13,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-20 01:08:13,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:08:13,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash -125198710, now seen corresponding path program 1 times [2023-05-20 01:08:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:13,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794515078] [2023-05-20 01:08:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-05-20 01:08:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794515078] [2023-05-20 01:08:14,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794515078] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:08:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336545870] [2023-05-20 01:08:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:14,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:08:14,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:08:14,155 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:08:14,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-20 01:08:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:15,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 4415 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 01:08:15,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:08:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-05-20 01:08:15,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 01:08:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-05-20 01:08:15,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336545870] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 01:08:15,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 01:08:15,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 01:08:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605028214] [2023-05-20 01:08:15,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 01:08:15,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 01:08:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:15,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 01:08:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 01:08:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:15,256 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:15,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:08:15,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:15,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:15,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:15,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:15,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:15,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-20 01:08:15,897 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,SelfDestructingSolverStorable12 [2023-05-20 01:08:15,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1680356340, now seen corresponding path program 2 times [2023-05-20 01:08:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034222650] [2023-05-20 01:08:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2023-05-20 01:08:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:16,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034222650] [2023-05-20 01:08:16,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034222650] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:08:16,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 01:08:16,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 01:08:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237144150] [2023-05-20 01:08:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:08:16,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 01:08:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 01:08:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 01:08:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:16,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:16,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:08:16,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:16,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:16,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:16,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-20 01:08:16,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 926700135, now seen corresponding path program 1 times [2023-05-20 01:08:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:16,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652753134] [2023-05-20 01:08:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 01:08:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652753134] [2023-05-20 01:08:17,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652753134] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:08:17,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35428917] [2023-05-20 01:08:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:08:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:08:17,151 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:08:17,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-20 01:08:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:17,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 01:08:17,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:08:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 01:08:17,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 01:08:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 01:08:17,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35428917] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 01:08:17,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 01:08:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-05-20 01:08:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281561098] [2023-05-20 01:08:17,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 01:08:17,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-20 01:08:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-20 01:08:17,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-05-20 01:08:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:17,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:17,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-20 01:08:18,003 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,SelfDestructingSolverStorable14 [2023-05-20 01:08:18,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:18,004 INFO L85 PathProgramCache]: Analyzing trace with hash 461915570, now seen corresponding path program 2 times [2023-05-20 01:08:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:18,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420402703] [2023-05-20 01:08:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-20 01:08:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420402703] [2023-05-20 01:08:18,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420402703] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:08:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728404175] [2023-05-20 01:08:18,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 01:08:18,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:08:18,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:08:18,152 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:08:18,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-20 01:08:18,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 01:08:18,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 01:08:18,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 01:08:18,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:08:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-20 01:08:18,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:08:18,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728404175] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:08:18,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:08:18,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-05-20 01:08:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240256242] [2023-05-20 01:08:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:08:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 01:08:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:18,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 01:08:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-05-20 01:08:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:18,797 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:18,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:08:18,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:18,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:18,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:18,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:18,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:24,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-20 01:08:24,765 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,SelfDestructingSolverStorable15 [2023-05-20 01:08:24,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1804690271, now seen corresponding path program 1 times [2023-05-20 01:08:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:24,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251125943] [2023-05-20 01:08:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 200 proven. 1 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-05-20 01:08:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251125943] [2023-05-20 01:08:25,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251125943] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:08:25,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376706071] [2023-05-20 01:08:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:08:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:08:25,854 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:08:25,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-20 01:08:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:26,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 4827 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 01:08:26,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:08:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-05-20 01:08:27,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 01:08:27,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376706071] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:08:27,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 01:08:27,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-05-20 01:08:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173813186] [2023-05-20 01:08:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:08:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-20 01:08:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-20 01:08:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-05-20 01:08:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:27,166 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:27,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 258.4) internal successors, (1292), 5 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:27,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 01:08:27,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-20 01:08:27,603 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,SelfDestructingSolverStorable16 [2023-05-20 01:08:27,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1370080734, now seen corresponding path program 1 times [2023-05-20 01:08:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:27,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340564673] [2023-05-20 01:08:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:08:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2023-05-20 01:08:28,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:08:28,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340564673] [2023-05-20 01:08:28,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340564673] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 01:08:28,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 01:08:28,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-20 01:08:28,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78131013] [2023-05-20 01:08:28,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 01:08:28,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-20 01:08:28,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:08:28,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-20 01:08:28,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-05-20 01:08:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:28,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:08:28,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 01:08:28,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:08:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:08:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:08:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 01:08:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 01:08:29,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-20 01:08:29,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-20 01:08:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 01:08:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1430792114, now seen corresponding path program 1 times [2023-05-20 01:08:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 01:08:29,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846247937] [2023-05-20 01:08:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:08:29,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 01:08:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:10:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-05-20 01:10:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 01:10:41,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846247937] [2023-05-20 01:10:41,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846247937] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 01:10:41,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506204006] [2023-05-20 01:10:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 01:10:41,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:10:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 01:10:41,739 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 01:10:41,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-20 01:10:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 01:10:42,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 4622 conjuncts, 314 conjunts are in the unsatisfiable core [2023-05-20 01:10:42,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 01:10:43,579 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 01:10:43,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 01:10:45,074 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-20 01:10:45,342 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 23 treesize of output 22 [2023-05-20 01:10:46,309 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 23 treesize of output 22 [2023-05-20 01:10:46,843 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-20 01:10:46,926 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-20 01:10:47,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-20 01:10:47,522 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-20 01:10:47,799 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-20 01:10:47,931 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-20 01:10:50,837 INFO L356 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2023-05-20 01:10:50,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 128 [2023-05-20 01:10:50,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2023-05-20 01:10:50,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 73 [2023-05-20 01:10:50,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 01:10:50,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 23 [2023-05-20 01:10:52,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:10:52,839 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 126 treesize of output 114 [2023-05-20 01:10:52,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2023-05-20 01:10:52,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 94 [2023-05-20 01:10:52,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-20 01:10:52,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 11 treesize of output 7 [2023-05-20 01:10:55,694 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-20 01:10:57,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 01:10:57,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:10:57,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 101 [2023-05-20 01:10:57,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2023-05-20 01:10:57,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2023-05-20 01:10:58,356 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 51 treesize of output 43 [2023-05-20 01:10:58,362 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 7 treesize of output 3 [2023-05-20 01:11:02,659 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-20 01:11:04,741 INFO L356 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2023-05-20 01:11:04,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 128 [2023-05-20 01:11:04,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2023-05-20 01:11:04,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 73 [2023-05-20 01:11:04,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 01:11:04,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 40 [2023-05-20 01:11:07,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:07,450 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 82 treesize of output 80 [2023-05-20 01:11:07,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2023-05-20 01:11:07,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2023-05-20 01:11:07,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-20 01:11:07,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-20 01:11:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 139 proven. 35 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2023-05-20 01:11:09,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 01:11:10,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:10,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2023-05-20 01:11:10,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:10,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2023-05-20 01:11:12,805 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 5 treesize of output 3 [2023-05-20 01:11:15,364 INFO L356 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-05-20 01:11:15,365 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 121 treesize of output 106 [2023-05-20 01:11:15,413 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 108 treesize of output 100 [2023-05-20 01:11:18,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:18,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 115 [2023-05-20 01:11:18,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:18,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 109 [2023-05-20 01:11:22,473 INFO L356 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-05-20 01:11:22,474 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 121 treesize of output 106 [2023-05-20 01:11:22,519 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 200 treesize of output 188 [2023-05-20 01:11:25,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:25,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2023-05-20 01:11:25,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:11:25,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2023-05-20 01:11:28,482 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 5 treesize of output 3 [2023-05-20 01:11:31,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse2 |c_~#q~0.base|) .cse1) .cse3) (not (= .cse3 0)))))))) is different from false [2023-05-20 01:11:33,334 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:33,404 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12873 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12873) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse0))))) (forall ((v_ArrVal_12873 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12873) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:34,916 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)))))) (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:34,931 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2023-05-20 01:11:35,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12871 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12871) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_12871 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12871) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:35,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12871 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12871) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse0))))) (forall ((v_ArrVal_12871 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12871) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:35,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse3 |c_~#q~0.base|) .cse1) .cse4) (not (= .cse4 0)))))))) is different from false [2023-05-20 01:11:35,214 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store .cse3 |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store .cse3 |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse4 |c_~#q~0.base| (store (select .cse4 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse4 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:39,141 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#q~0.base|)) (.cse4 (+ |c_~#q~0.offset| 36))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)) (not (= .cse0 0)))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#q~0.base| (store .cse3 .cse4 v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse5 |c_~#q~0.base| (store (select .cse5 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse5 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-20 01:11:39,179 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#q~0.base|)) (.cse3 (+ 104 |c_~#q~0.offset|)) (.cse4 (+ |c_~#q~0.offset| 36))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12867 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse2 .cse3 v_ArrVal_12867) .cse4 v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12867 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse2 .cse3 v_ArrVal_12867) .cse4 v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse5 (select (select .cse6 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse5 0)) (= .cse5 (select (select .cse6 |c_~#q~0.base|) .cse1)))))))) is different from false [2023-05-20 01:11:39,367 INFO L356 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2023-05-20 01:11:39,367 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 3 case distinctions, treesize of input 137 treesize of output 95 [2023-05-20 01:11:39,394 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-05-20 01:11:39,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1529 treesize of output 1485 [2023-05-20 01:11:39,414 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 1540 treesize of output 1502 [2023-05-20 01:11:39,425 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 1694 treesize of output 1618 [2023-05-20 01:11:39,456 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 6 treesize of output 4 [2023-05-20 01:16:20,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:16:20,087 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 94 treesize of output 96 [2023-05-20 01:16:20,167 INFO L356 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2023-05-20 01:16:20,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 91 [2023-05-20 01:16:20,193 INFO L356 Elim1Store]: treesize reduction 13, result has 65.8 percent of original size [2023-05-20 01:16:20,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 397 treesize of output 373 [2023-05-20 01:16:20,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:16:20,215 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 322 treesize of output 280 [2023-05-20 01:16:20,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:16:20,228 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 270 treesize of output 254 [2023-05-20 01:16:29,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 01:16:29,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 78 [2023-05-20 01:16:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 139 proven. 3 refuted. 0 times theorem prover too weak. 323 trivial. 41 not checked. [2023-05-20 01:16:29,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506204006] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 01:16:29,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 01:16:29,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 86, 77] total 248 [2023-05-20 01:16:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849497681] [2023-05-20 01:16:29,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 01:16:29,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 248 states [2023-05-20 01:16:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 01:16:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2023-05-20 01:16:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1187, Invalid=53848, Unknown=941, NotChecked=5280, Total=61256 [2023-05-20 01:16:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:16:29,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 01:16:29,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 248 states, 248 states have (on average 8.883064516129032) internal successors, (2203), 248 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 01:16:29,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 01:16:29,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 01:18:15,354 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|)) (.cse1 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_#in~v#1.base|)) (.cse45 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|)) (.cse35 (+ |c_~#q~0.offset| 28)) (.cse15 (+ 104 |c_~#q~0.offset|)) (.cse36 (+ |c_~#q~0.offset| 24))) (let ((.cse51 (store (store (store .cse45 .cse35 0) .cse15 0) .cse36 0)) (.cse50 (store (store (store .cse1 .cse35 0) .cse15 0) .cse36 0)) (.cse10 (store (store (store .cse14 .cse35 0) .cse15 0) .cse36 0)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse11 (@diff .cse10 .cse5)) (.cse49 (@diff .cse50 .cse5)) (.cse52 (@diff .cse51 .cse5))) (let ((.cse16 (store .cse51 .cse52 0)) (.cse44 (store .cse50 .cse49 0)) (.cse42 (store .cse10 .cse11 0))) (let ((.cse41 (@diff .cse42 .cse5)) (.cse43 (@diff .cse44 .cse5)) (.cse17 (@diff .cse16 .cse5))) (let ((.cse7 (store .cse16 .cse17 0)) (.cse6 (store .cse44 .cse43 0)) (.cse23 (store .cse42 .cse41 0))) (let ((.cse24 (@diff .cse23 .cse5)) (.cse4 (@diff .cse6 .cse5)) (.cse8 (@diff .cse7 .cse5))) (let ((.cse53 (select .cse45 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|)) (.cse47 (store .cse7 .cse8 0)) (.cse13 (store .cse6 .cse4 0)) (.cse9 (select |c_#memory_int| |c_~#q~0.base|)) (.cse18 (store .cse23 .cse24 0))) (let ((.cse19 (@diff .cse18 .cse5)) (.cse2 (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset| 0)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base|)) (.cse20 (= .cse5 (store (store (store .cse9 .cse35 0) .cse15 0) .cse36 0))) (.cse12 (@diff .cse13 .cse5)) (.cse48 (@diff .cse47 .cse5)) (.cse46 (= .cse53 (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|))) (.cse22 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~v#1.base|)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~#handles~0#1.offset| 0) (= |c_StealerThread1of2ForFork0_readV_#in~v#1.base| |c_~#q~0.base|) (= (select .cse1 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) 0) (or (not (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|)) .cse2) (not (= .cse3 0)) (or (<= .cse4 .cse3) (= .cse5 .cse6)) (or (= .cse5 .cse7) (<= .cse8 .cse3)) (= (select .cse9 .cse3) 0) (or (= .cse5 .cse10) (<= .cse11 .cse3)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= .cse3 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| |c_~#q~0.base|) (or (<= .cse12 .cse3) (= .cse5 .cse13)) (<= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (<= 1 (select .cse14 .cse15)) (<= 1 (select .cse9 .cse15)) (or (= .cse5 .cse16) (<= .cse17 .cse3)) (= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|) (= (select .cse14 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) .cse0) (= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (= .cse5 (store .cse18 .cse19 0)) (or .cse20 (= (select .cse21 .cse3) 0)) (= (select .cse22 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) .cse0) (or (= .cse5 .cse18) (<= .cse19 .cse3)) (or (= .cse5 .cse23) (<= .cse24 .cse3)) (let ((.cse26 (store (store (store .cse22 .cse35 0) .cse15 0) .cse36 0))) (let ((.cse34 (@diff .cse26 .cse5))) (let ((.cse28 (store .cse26 .cse34 0))) (let ((.cse33 (@diff .cse28 .cse5))) (let ((.cse25 (<= .cse34 .cse3)) (.cse29 (<= .cse33 .cse3)) (.cse27 (store .cse28 .cse33 0))) (or (and (or .cse25 (= .cse5 .cse26)) (= .cse5 .cse27) (or (= .cse5 .cse28) .cse29)) (let ((.cse30 (@diff .cse27 .cse5))) (let ((.cse32 (store .cse27 .cse30 0))) (let ((.cse31 (@diff .cse32 .cse5))) (and .cse25 (<= .cse30 .cse3) (or (<= .cse31 .cse3) (= .cse5 .cse32)) (= .cse5 (store .cse32 .cse31 0)) .cse29)))))))))) (= |c_~#q~0.offset| 0) (<= .cse3 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) (<= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| .cse3) (= 3 |c_~#q~0.base|) .cse2 (<= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| .cse3) (= .cse3 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) .cse20 (or (let ((.cse40 (store (store (store .cse21 .cse35 0) .cse15 0) .cse36 0))) (let ((.cse39 (@diff .cse40 .cse5))) (let ((.cse37 (store .cse40 .cse39 0))) (let ((.cse38 (@diff .cse37 .cse5))) (and (= |c_ULTIMATE.start_main_~#handles~0#1.base| |c_~#q~0.base|) (or (= .cse5 .cse37) (<= .cse38 .cse3)) (= .cse5 (store .cse37 .cse38 0)) (<= .cse39 .cse3)))))) .cse20) (= .cse5 (store .cse13 .cse12 0)) (= |c_~#items~0.base| 4) (or (<= .cse41 .cse3) (= .cse5 .cse42)) (or (<= .cse43 .cse3) (= .cse5 .cse44)) (<= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~v#1.base| |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| 0) (= .cse3 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) (or (forall ((v_ArrVal_12878 Int)) (= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse45 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_12878)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (not .cse46)) (= .cse5 (store .cse47 .cse48 0)) (<= 1 (select .cse45 .cse15)) (or (<= .cse49 .cse3) (= .cse5 .cse50)) (<= |c_StealerThread1of2ForFork0_readV_#in~v#1.offset| .cse3) (or (<= .cse48 .cse3) (= .cse5 .cse47)) (<= 1 (select .cse1 .cse15)) (not (= |c_~#items~0.base| |c_~#q~0.base|)) (or (= .cse5 .cse51) (<= .cse52 .cse3)) (or .cse46 (forall ((v_ArrVal_12881 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_12881) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) (<= 1 (select .cse22 .cse15)) (<= |c_StealerThread1of2ForFork0_readV_~v#1.offset| .cse3) (= .cse53 .cse0))))))))))) is different from true [2023-05-20 01:18:57,571 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_readV_~v#1.base|)) (.cse12 (+ 104 |c_~#q~0.offset|))) (let ((.cse18 (store (store (store .cse11 (+ |c_~#q~0.offset| 28) 0) .cse12 0) (+ |c_~#q~0.offset| 24) 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse17 (@diff .cse18 .cse2))) (let ((.cse20 (store .cse18 .cse17 0))) (let ((.cse19 (@diff .cse20 .cse2))) (let ((.cse16 (store .cse20 .cse19 0))) (let ((.cse15 (@diff .cse16 .cse2))) (let ((.cse13 (store .cse16 .cse15 0))) (let ((.cse14 (@diff .cse13 .cse2))) (let ((.cse3 (store .cse13 .cse14 0)) (.cse21 (select |c_#memory_int| |c_~#q~0.base|)) (.cse22 (+ 32 |c_~#q~0.offset|)) (.cse9 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|))) (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse0 (= (select .cse9 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (.cse5 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_12878 Int)) (let ((.cse23 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) (and (= (store .cse23 .cse22 v_ArrVal_12878) .cse21) (= (select .cse23 .cse22) 0))))) (.cse6 (exists ((v_ArrVal_12878 Int)) (= (store .cse9 .cse22 v_ArrVal_12878) .cse21))) (.cse7 (= (select .cse9 .cse22) 0)) (.cse10 (and (= (select .cse21 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_~#q~0.base|))) (.cse4 (@diff .cse3 .cse2))) (and .cse0 (<= |c_ULTIMATE.start_readV_~v#1.offset| .cse1) (= .cse2 (store .cse3 .cse4 0)) (or (and .cse0 (or .cse5 (and .cse6 .cse7 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) (and (= .cse8 v_DerPreprocessor_1) (= .cse9 .cse8))))))) .cse10) (<= .cse1 |c_ULTIMATE.start_readV_~v#1.offset|) (<= 1 (select .cse11 .cse12)) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (or (= .cse2 .cse13) (<= (+ .cse14 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (or (and .cse0 (or .cse5 (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) .cse6 .cse7))) .cse10) (= |c_~#q~0.base| |c_ULTIMATE.start_readV_~v#1.base|) (or (= .cse2 .cse3) (<= (+ .cse4 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (or (<= (+ 4 .cse15) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse2 .cse16)) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| 0) (or (<= (+ .cse17 4) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse2 .cse18)) (or (<= (+ .cse19 4) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse2 .cse20)) (= |c_ULTIMATE.start_readV_~#expected~0#1.offset| 0) (not (= |c_~#items~0.base| |c_~#q~0.base|)))))))))))))) is different from true [2023-05-20 01:19:02,687 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|))) (let ((.cse1 (+ |c_~#q~0.offset| 36)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_readV_~v#1.base|)) (.cse3 (+ 104 |c_~#q~0.offset|)) (.cse0 (= (select .cse21 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) (and .cse0 (<= |c_ULTIMATE.start_readV_~v#1.offset| .cse1) (<= .cse1 |c_ULTIMATE.start_readV_~v#1.offset|) (<= 1 (select .cse2 .cse3)) (let ((.cse13 (store (store (store .cse2 (+ |c_~#q~0.offset| 28) 0) .cse3 0) (+ |c_~#q~0.offset| 24) 0)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse16 (@diff .cse13 .cse4))) (let ((.cse14 (store .cse13 .cse16 0))) (let ((.cse15 (@diff .cse14 .cse4))) (let ((.cse12 (store .cse14 .cse15 0))) (let ((.cse17 (@diff .cse12 .cse4))) (let ((.cse11 (store .cse12 .cse17 0)) (.cse9 (<= (+ 4 .cse17) |c_ULTIMATE.start_readV_~v#1.offset|)) (.cse8 (<= (+ .cse16 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (.cse7 (<= (+ .cse15 4) |c_ULTIMATE.start_readV_~v#1.offset|))) (or (let ((.cse10 (@diff .cse11 .cse4))) (let ((.cse5 (store .cse11 .cse10 0))) (let ((.cse6 (@diff .cse5 .cse4))) (and (= .cse4 (store .cse5 .cse6 0)) .cse7 .cse8 (or (= .cse4 .cse5) (<= (+ .cse6 4) |c_ULTIMATE.start_readV_~v#1.offset|)) .cse9 (<= (+ .cse10 4) |c_ULTIMATE.start_readV_~v#1.offset|))))) (and (= .cse4 .cse11) (or .cse9 (= .cse4 .cse12)) (or .cse8 (= .cse4 .cse13)) (or .cse7 (= .cse4 .cse14))))))))))) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (let ((.cse20 (select |c_#memory_int| |c_~#q~0.base|))) (or (and .cse0 (let ((.cse19 (+ 32 |c_~#q~0.offset|))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_12878 Int)) (let ((.cse18 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) (and (= (store .cse18 .cse19 v_ArrVal_12878) .cse20) (= (select .cse18 .cse19) 0)))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse21 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) (exists ((v_ArrVal_12878 Int)) (= (store .cse21 .cse19 v_ArrVal_12878) .cse20)) (= (select .cse21 .cse19) 0))))) (and (= (select .cse20 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_~#q~0.base|)))) (= |c_~#q~0.base| |c_ULTIMATE.start_readV_~v#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_readV_~#expected~0#1.base|) |c_ULTIMATE.start_readV_~#expected~0#1.offset|) 0) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| 0) (= |c_ULTIMATE.start_readV_~#expected~0#1.offset| 0) (not (= |c_~#items~0.base| |c_~#q~0.base|))))) is different from true Received shutdown request... [2023-05-20 01:20:50,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 01:20:50,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 01:20:50,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 01:20:50,529 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 01:20:51,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-20 01:20:51,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 01:20:51,432 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2023-05-20 01:20:51,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-05-20 01:20:51,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-05-20 01:20:51,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-05-20 01:20:51,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-05-20 01:20:51,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-05-20 01:20:51,432 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-05-20 01:20:51,434 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-05-20 01:20:51,435 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-05-20 01:20:51,435 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 01:20:51,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 01:20:51 BasicIcfg [2023-05-20 01:20:51,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 01:20:51,437 INFO L158 Benchmark]: Toolchain (without parser) took 800203.90ms. Allocated memory was 185.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 156.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 785.7MB. Max. memory is 8.0GB. [2023-05-20 01:20:51,437 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 01:20:51,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.35ms. Allocated memory was 185.6MB in the beginning and 237.0MB in the end (delta: 51.4MB). Free memory was 156.3MB in the beginning and 155.5MB in the end (delta: 708.6kB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2023-05-20 01:20:51,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.83ms. Allocated memory is still 237.0MB. Free memory was 155.5MB in the beginning and 146.1MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-05-20 01:20:51,438 INFO L158 Benchmark]: Boogie Preprocessor took 72.53ms. Allocated memory is still 237.0MB. Free memory was 146.1MB in the beginning and 137.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-05-20 01:20:51,438 INFO L158 Benchmark]: RCFGBuilder took 1804.23ms. Allocated memory is still 237.0MB. Free memory was 137.2MB in the beginning and 112.4MB in the end (delta: 24.8MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. [2023-05-20 01:20:51,438 INFO L158 Benchmark]: TraceAbstraction took 797591.90ms. Allocated memory was 237.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 111.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 688.6MB. Max. memory is 8.0GB. [2023-05-20 01:20:51,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 628.35ms. Allocated memory was 185.6MB in the beginning and 237.0MB in the end (delta: 51.4MB). Free memory was 156.3MB in the beginning and 155.5MB in the end (delta: 708.6kB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 100.83ms. Allocated memory is still 237.0MB. Free memory was 155.5MB in the beginning and 146.1MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.53ms. Allocated memory is still 237.0MB. Free memory was 146.1MB in the beginning and 137.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1804.23ms. Allocated memory is still 237.0MB. Free memory was 137.2MB in the beginning and 112.4MB in the end (delta: 24.8MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. * TraceAbstraction took 797591.90ms. Allocated memory was 237.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 111.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 688.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 269074, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 1125, dependent conditional: 1085, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 16, unknown conditional: 8, unknown unconditional: 8] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167747, independent: 167702, independent conditional: 0, independent unconditional: 167702, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167747, independent: 167685, independent conditional: 0, independent unconditional: 167685, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6304, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 505, dependent conditional: 0, dependent unconditional: 505, unknown: 5713, unknown conditional: 0, unknown unconditional: 5713] , Protected Queries: 0 ], Cache Queries: [ total: 268008, independent: 100239, independent conditional: 0, independent unconditional: 100239, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 167758, unknown conditional: 0, unknown unconditional: 167758] , Statistics on independence cache: Total cache size (in pairs): 167742, Positive cache size: 167702, Positive conditional cache size: 0, Positive unconditional cache size: 167702, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 1082 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 7.0s, Number of persistent set computation: 1604, Number of trivial persistent sets: 1604, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267020, independent: 266975, independent conditional: 0, independent unconditional: 266975, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 269074, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 1125, dependent conditional: 1085, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 16, unknown conditional: 8, unknown unconditional: 8] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167747, independent: 167702, independent conditional: 0, independent unconditional: 167702, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167747, independent: 167685, independent conditional: 0, independent unconditional: 167685, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6304, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 505, dependent conditional: 0, dependent unconditional: 505, unknown: 5713, unknown conditional: 0, unknown unconditional: 5713] , Protected Queries: 0 ], Cache Queries: [ total: 268008, independent: 100239, independent conditional: 0, independent unconditional: 100239, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 167758, unknown conditional: 0, unknown unconditional: 167758] , Statistics on independence cache: Total cache size (in pairs): 167742, Positive cache size: 167702, Positive conditional cache size: 0, Positive unconditional cache size: 167702, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 1082 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 765667, independent: 763001, independent conditional: 6683, independent unconditional: 756318, dependent: 2651, dependent conditional: 2443, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763253, independent: 763001, independent conditional: 6683, independent unconditional: 756318, dependent: 237, dependent conditional: 29, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763253, independent: 763001, independent conditional: 6683, independent unconditional: 756318, dependent: 237, dependent conditional: 29, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763400, independent: 763001, independent conditional: 0, independent unconditional: 763001, dependent: 384, dependent conditional: 147, dependent unconditional: 237, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763400, independent: 763001, independent conditional: 0, independent unconditional: 763001, dependent: 384, dependent conditional: 13, dependent unconditional: 371, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763400, independent: 763001, independent conditional: 0, independent unconditional: 763001, dependent: 384, dependent conditional: 13, dependent unconditional: 371, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 455411, independent: 455181, independent conditional: 0, independent unconditional: 455181, dependent: 215, dependent conditional: 7, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455411, independent: 455111, independent conditional: 0, independent unconditional: 455111, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 300, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 215, dependent conditional: 7, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 300, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 215, dependent conditional: 7, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19953, independent: 328, independent conditional: 0, independent unconditional: 328, dependent: 2243, dependent conditional: 52, dependent unconditional: 2191, unknown: 17382, unknown conditional: 0, unknown unconditional: 17382] , Protected Queries: 0 ], Cache Queries: [ total: 763400, independent: 307820, independent conditional: 0, independent unconditional: 307820, dependent: 169, dependent conditional: 6, dependent unconditional: 163, unknown: 455411, unknown conditional: 7, unknown unconditional: 455404] , Statistics on independence cache: Total cache size (in pairs): 455396, Positive cache size: 455181, Positive conditional cache size: 0, Positive unconditional cache size: 455181, Negative cache size: 215, Negative conditional cache size: 7, Negative unconditional cache size: 208, Unknown cache size: 15, Unknown conditional cache size: 0, Unknown unconditional cache size: 15, Eliminated conditions: 134, Maximal queried relation: 9, Independence queries for same thread: 2414 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 21.2s, Number of persistent set computation: 3844, Number of trivial persistent sets: 3638, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 756541, independent: 756318, independent conditional: 0, independent unconditional: 756318, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 765667, independent: 763001, independent conditional: 6683, independent unconditional: 756318, dependent: 2651, dependent conditional: 2443, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763253, independent: 763001, independent conditional: 6683, independent unconditional: 756318, dependent: 237, dependent conditional: 29, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763253, independent: 763001, independent conditional: 6683, independent unconditional: 756318, dependent: 237, dependent conditional: 29, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763400, independent: 763001, independent conditional: 0, independent unconditional: 763001, dependent: 384, dependent conditional: 147, dependent unconditional: 237, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763400, independent: 763001, independent conditional: 0, independent unconditional: 763001, dependent: 384, dependent conditional: 13, dependent unconditional: 371, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763400, independent: 763001, independent conditional: 0, independent unconditional: 763001, dependent: 384, dependent conditional: 13, dependent unconditional: 371, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 455411, independent: 455181, independent conditional: 0, independent unconditional: 455181, dependent: 215, dependent conditional: 7, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455411, independent: 455111, independent conditional: 0, independent unconditional: 455111, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 300, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 215, dependent conditional: 7, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 300, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 215, dependent conditional: 7, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19953, independent: 328, independent conditional: 0, independent unconditional: 328, dependent: 2243, dependent conditional: 52, dependent unconditional: 2191, unknown: 17382, unknown conditional: 0, unknown unconditional: 17382] , Protected Queries: 0 ], Cache Queries: [ total: 763400, independent: 307820, independent conditional: 0, independent unconditional: 307820, dependent: 169, dependent conditional: 6, dependent unconditional: 163, unknown: 455411, unknown conditional: 7, unknown unconditional: 455404] , Statistics on independence cache: Total cache size (in pairs): 455396, Positive cache size: 455181, Positive conditional cache size: 0, Positive unconditional cache size: 455181, Negative cache size: 215, Negative conditional cache size: 7, Negative unconditional cache size: 208, Unknown cache size: 15, Unknown conditional cache size: 0, Unknown unconditional cache size: 15, Eliminated conditions: 134, Maximal queried relation: 9, Independence queries for same thread: 2414 - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 1764 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 8.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 12678 NumberOfCodeBlocks, 11931 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 15059 ConstructedInterpolants, 0 QuantifiedInterpolants, 15404 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15665 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 3574/3647 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 1909 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 778.3s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 285.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 482.9s InterpolantComputationTime, 17157 NumberOfCodeBlocks, 17157 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 20436 ConstructedInterpolants, 250 QuantifiedInterpolants, 172713 SizeOfPredicates, 173 NumberOfNonLiveVariables, 19383 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 6138/6344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown