/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 01:55:24,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 01:55:24,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 01:55:24,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 01:55:24,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 01:55:24,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 01:55:24,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 01:55:24,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 01:55:24,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 01:55:24,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 01:55:24,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 01:55:24,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 01:55:24,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 01:55:24,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 01:55:24,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 01:55:24,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 01:55:24,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 01:55:24,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 01:55:24,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 01:55:24,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 01:55:24,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 01:55:24,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 01:55:24,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 01:55:24,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 01:55:24,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 01:55:24,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 01:55:24,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 01:55:24,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 01:55:24,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 01:55:24,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 01:55:24,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 01:55:24,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 01:55:24,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 01:55:24,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 01:55:24,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 01:55:24,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 01:55:24,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 01:55:24,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 01:55:24,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 01:55:24,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 01:55:24,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 01:55:24,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 01:55:24,985 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 01:55:24,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 01:55:24,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 01:55:24,985 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 01:55:24,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 01:55:24,986 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 01:55:24,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 01:55:24,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 01:55:24,986 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 01:55:24,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 01:55:24,987 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 01:55:24,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 01:55:24,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 01:55:24,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 01:55:24,989 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 01:55:24,989 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 -> true [2023-05-04 01:55:25,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 01:55:25,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 01:55:25,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 01:55:25,197 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 01:55:25,198 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 01:55:25,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-05-04 01:55:25,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295fdd1c2/929207c19f884811acad6c2c0cec6353/FLAG504c897e4 [2023-05-04 01:55:25,707 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 01:55:25,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-05-04 01:55:25,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295fdd1c2/929207c19f884811acad6c2c0cec6353/FLAG504c897e4 [2023-05-04 01:55:25,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295fdd1c2/929207c19f884811acad6c2c0cec6353 [2023-05-04 01:55:25,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 01:55:25,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 01:55:25,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 01:55:25,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 01:55:25,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 01:55:25,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 01:55:25" (1/1) ... [2023-05-04 01:55:25,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bfc362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:25, skipping insertion in model container [2023-05-04 01:55:25,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 01:55:25" (1/1) ... [2023-05-04 01:55:25,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 01:55:25,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 01:55:26,045 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-ext/04_incdec_cas.i[30285,30298] [2023-05-04 01:55:26,050 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-ext/04_incdec_cas.i[30729,30742] [2023-05-04 01:55:26,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 01:55:26,058 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 01:55:26,086 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-ext/04_incdec_cas.i[30285,30298] [2023-05-04 01:55:26,088 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-ext/04_incdec_cas.i[30729,30742] [2023-05-04 01:55:26,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 01:55:26,127 INFO L208 MainTranslator]: Completed translation [2023-05-04 01:55:26,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26 WrapperNode [2023-05-04 01:55:26,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 01:55:26,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 01:55:26,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 01:55:26,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 01:55:26,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,179 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2023-05-04 01:55:26,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 01:55:26,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 01:55:26,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 01:55:26,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 01:55:26,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 01:55:26,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 01:55:26,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 01:55:26,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 01:55:26,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (1/1) ... [2023-05-04 01:55:26,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 01:55:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:55:26,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 01:55:26,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 01:55:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 01:55:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-05-04 01:55:26,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-05-04 01:55:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 01:55:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 01:55:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 01:55:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 01:55:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 01:55:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 01:55:26,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 01:55:26,275 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 01:55:26,419 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 01:55:26,421 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 01:55:26,672 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 01:55:26,788 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 01:55:26,788 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 01:55:26,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 01:55:26 BoogieIcfgContainer [2023-05-04 01:55:26,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 01:55:26,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 01:55:26,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 01:55:26,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 01:55:26,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 01:55:25" (1/3) ... [2023-05-04 01:55:26,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8153f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 01:55:26, skipping insertion in model container [2023-05-04 01:55:26,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:55:26" (2/3) ... [2023-05-04 01:55:26,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8153f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 01:55:26, skipping insertion in model container [2023-05-04 01:55:26,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 01:55:26" (3/3) ... [2023-05-04 01:55:26,795 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-05-04 01:55:26,800 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 01:55:26,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 01:55:26,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-04 01:55:26,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 01:55:26,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 01:55:26,941 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:55:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:55:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:55:26,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 01:55:26,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 01:55:26,980 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:55:27,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-05-04 01:55:27,017 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;@25332b5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:55:27,018 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 01:55:27,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:55:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:55:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 836751063, now seen corresponding path program 1 times [2023-05-04 01:55:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:55:27,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913608309] [2023-05-04 01:55:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:55:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:55:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:55:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:55:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:55:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913608309] [2023-05-04 01:55:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913608309] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:55:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:55:28,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 01:55:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588262989] [2023-05-04 01:55:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:55:28,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-04 01:55:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:55:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-04 01:55:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-05-04 01:55:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:55:28,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:55:28,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:55:28,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:55:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:55:28,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 01:55:28,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:55:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:55:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2016086959, now seen corresponding path program 2 times [2023-05-04 01:55:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:55:28,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116984643] [2023-05-04 01:55:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:55:28,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:55:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:55:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:55:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:55:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116984643] [2023-05-04 01:55:29,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116984643] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:55:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343878055] [2023-05-04 01:55:29,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 01:55:29,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:55:29,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:55:29,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:55:29,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 01:55:29,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 01:55:29,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 01:55:29,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 72 conjunts are in the unsatisfiable core [2023-05-04 01:55:29,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:55:29,974 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-05-04 01:55:29,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-05-04 01:55:30,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-05-04 01:55:30,307 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-04 01:55:30,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 01:55:30,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:30,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:30,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:30,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:30,728 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 01:55:30,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 208 [2023-05-04 01:55:30,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:55:30,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2023-05-04 01:55:31,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:31,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:31,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:31,156 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-05-04 01:55:31,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 112 [2023-05-04 01:55:31,171 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-04 01:55:31,178 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-04 01:55:31,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-05-04 01:55:31,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:55:31,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 33 [2023-05-04 01:55:31,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2023-05-04 01:55:32,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:55:32,559 INFO L356 Elim1Store]: treesize reduction 78, result has 40.0 percent of original size [2023-05-04 01:55:32,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 31245 treesize of output 31201 [2023-05-04 01:55:33,071 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 31208 treesize of output 30184 [2023-05-04 01:55:33,243 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 30184 treesize of output 30173 [2023-05-04 01:55:33,414 INFO L356 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-05-04 01:55:33,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30165 treesize of output 30173 [2023-05-04 01:55:33,577 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 30148 treesize of output 30147 [2023-05-04 01:55:35,662 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 5 [2023-05-04 01:55:35,695 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 5 [2023-05-04 01:55:35,751 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 100 treesize of output 94 [2023-05-04 01:55:35,855 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 5 [2023-05-04 01:55:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:55:35,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 01:55:35,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_83 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_83))) (or (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) is different from false [2023-05-04 01:55:36,058 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_83 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_83))) (or (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)) is different from false [2023-05-04 01:55:36,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_83 (Array Int Int)) (v_ArrVal_75 (Array Int Int)) (v_ArrVal_76 (Array Int Int)) (v_ArrVal_81 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_7| Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_7| v_ArrVal_76) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_7| v_ArrVal_81) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_7| v_ArrVal_73) |c_~#value~0.base| v_ArrVal_75) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_83))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_7| |c_~#inc_flag~0.base|) (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) is different from false [2023-05-04 01:55:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-05-04 01:55:48,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343878055] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 01:55:48,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 01:55:48,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 15] total 43 [2023-05-04 01:55:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567257567] [2023-05-04 01:55:48,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 01:55:48,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-05-04 01:55:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:55:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-05-04 01:55:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1357, Unknown=40, NotChecked=240, Total=1892 [2023-05-04 01:55:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:55:49,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:55:49,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.3255813953488373) internal successors, (143), 44 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:55:49,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:55:49,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:55:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:55:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 01:55:54,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 01:55:54,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 01:55:54,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:55:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:55:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash -4183285, now seen corresponding path program 1 times [2023-05-04 01:55:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:55:54,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143837467] [2023-05-04 01:55:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:55:54,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:55:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:55:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:55:57,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:55:57,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143837467] [2023-05-04 01:55:57,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143837467] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:55:57,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907190531] [2023-05-04 01:55:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:55:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:55:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:55:57,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:55:57,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 01:55:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:55:57,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 68 conjunts are in the unsatisfiable core [2023-05-04 01:55:57,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:55:59,560 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-05-04 01:55:59,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-05-04 01:55:59,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:55:59,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:55:59,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:55:59,895 INFO L244 Elim1Store]: Index analysis took 144 ms [2023-05-04 01:56:00,050 INFO L356 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2023-05-04 01:56:00,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 119 [2023-05-04 01:56:00,164 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-04 01:56:00,186 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-04 01:56:00,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:56:00,314 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:56:00,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:56:00,339 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:56:00,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 74 treesize of output 69 [2023-05-04 01:56:00,352 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-04 01:56:00,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:56:00,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 5 [2023-05-04 01:56:00,792 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-04 01:56:01,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 01:56:01,423 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 225 treesize of output 225 [2023-05-04 01:56:01,489 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-04 01:56:01,534 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-04 01:56:01,564 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-04 01:56:01,605 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-04 01:56:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:56:01,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 01:56:01,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907190531] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:56:01,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 01:56:01,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2023-05-04 01:56:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846712] [2023-05-04 01:56:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:56:01,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 01:56:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:56:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 01:56:01,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2023-05-04 01:56:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:56:01,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:56:01,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:56:01,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:56:01,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 01:56:01,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:56:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:56:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 01:56:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:56:02,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 01:56:02,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:56:02,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:56:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:56:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2121146211, now seen corresponding path program 3 times [2023-05-04 01:56:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:56:02,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63140263] [2023-05-04 01:56:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:56:02,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:56:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:56:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:56:04,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:56:04,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63140263] [2023-05-04 01:56:04,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63140263] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:56:04,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828952860] [2023-05-04 01:56:04,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 01:56:04,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:56:04,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:56:04,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:56:04,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 01:56:04,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 01:56:04,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 01:56:04,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 74 conjunts are in the unsatisfiable core [2023-05-04 01:56:04,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:56:06,617 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-05-04 01:56:06,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-05-04 01:56:07,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-05-04 01:56:08,712 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-05-04 01:56:08,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-05-04 01:56:10,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:10,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:10,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:10,911 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 01:56:10,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 213 [2023-05-04 01:56:10,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2023-05-04 01:56:11,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:56:11,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:11,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:11,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:11,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:11,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:11,728 INFO L244 Elim1Store]: Index analysis took 119 ms [2023-05-04 01:56:11,809 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-05-04 01:56:11,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 81 [2023-05-04 01:56:11,868 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-04 01:56:12,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:12,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2023-05-04 01:56:12,168 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-04 01:56:12,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-04 01:56:14,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:56:14,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 126 [2023-05-04 01:56:14,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-05-04 01:56:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:56:15,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 01:56:17,196 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296))) (and (forall ((v_ArrVal_238 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (= 0 (mod (select (select .cse0 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (or (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_230 (Array Int Int)) (v_ArrVal_233 (Array Int Int)) (v_ArrVal_236 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_236) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_237) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_230) |c_~#value~0.base| v_ArrVal_233) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (< |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| |c_~#inc_flag~0.base|))))) is different from false [2023-05-04 01:56:17,333 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296))) (and (forall ((v_ArrVal_238 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (= 0 (mod (select (select .cse0 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (or (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_230 (Array Int Int)) (v_ArrVal_233 (Array Int Int)) (v_ArrVal_236 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_236) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_237) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_230) |c_~#value~0.base| v_ArrVal_233) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (< .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 0 (mod (select (select .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (< |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| |c_~#inc_flag~0.base|))))) is different from false [2023-05-04 01:56:17,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of1ForFork0_inc_#t~mem8#1| 4294967296))) (and (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (or (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_230 (Array Int Int)) (v_ArrVal_233 (Array Int Int)) (v_ArrVal_236 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_236) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_237) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_inc_#t~mem8#1| 1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_230) |c_~#value~0.base| v_ArrVal_233) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))) (< |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| |c_~#inc_flag~0.base|))) (forall ((v_ArrVal_238 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (= 0 (mod (select (select .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse0 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2023-05-04 01:56:17,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (mod .cse3 4294967296))) (and (forall ((v_ArrVal_238 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (= 0 (mod (select (select .cse0 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (or (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_230 (Array Int Int)) (v_ArrVal_233 (Array Int Int)) (v_ArrVal_236 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_236) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_237) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse3))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_230) |c_~#value~0.base| v_ArrVal_233) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_238))) (or (< .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (= (mod (select (select .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))) (< |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| |c_~#inc_flag~0.base|)))))) is different from false [2023-05-04 01:56:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:56:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828952860] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 01:56:46,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 01:56:46,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 15] total 43 [2023-05-04 01:56:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139942103] [2023-05-04 01:56:46,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 01:56:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-05-04 01:56:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:56:46,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-05-04 01:56:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1311, Unknown=27, NotChecked=316, Total=1892 [2023-05-04 01:56:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:56:46,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:56:46,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.3255813953488373) internal successors, (143), 44 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:56:46,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:56:46,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 01:56:46,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:56:46,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:56:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:56:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 01:56:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:56:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 01:56:55,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 01:56:55,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:56:55,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:56:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:56:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 305158155, now seen corresponding path program 2 times [2023-05-04 01:56:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:56:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259405646] [2023-05-04 01:56:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:56:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:56:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:56:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:56:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:56:58,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259405646] [2023-05-04 01:56:58,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259405646] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:56:58,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182691126] [2023-05-04 01:56:58,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 01:56:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:56:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:56:58,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:56:58,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 01:56:58,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 01:56:58,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 01:56:58,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 77 conjunts are in the unsatisfiable core [2023-05-04 01:56:58,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:56:58,795 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 01:56:58,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 01:57:00,416 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 14 treesize of output 16 [2023-05-04 01:57:01,119 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-05-04 01:57:01,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-05-04 01:57:01,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:01,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:01,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:02,162 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-05-04 01:57:02,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 26 [2023-05-04 01:57:02,216 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-04 01:57:02,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:57:02,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 30 [2023-05-04 01:57:02,271 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-04 01:57:02,282 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-04 01:57:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:57:03,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 01:57:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182691126] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:03,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 01:57:03,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2023-05-04 01:57:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474285758] [2023-05-04 01:57:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:03,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 01:57:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 01:57:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=547, Unknown=4, NotChecked=0, Total=650 [2023-05-04 01:57:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:03,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:03,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:03,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:03,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-04 01:57:03,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:03,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 01:57:03,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 01:57:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 01:57:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:57:06,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 01:57:06,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:57:06,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash 968064218, now seen corresponding path program 1 times [2023-05-04 01:57:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980798598] [2023-05-04 01:57:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:57:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:07,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980798598] [2023-05-04 01:57:07,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980798598] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:07,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:07,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-05-04 01:57:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099572607] [2023-05-04 01:57:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:07,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-05-04 01:57:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-05-04 01:57:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-05-04 01:57:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:07,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:07,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:07,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:07,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-04 01:57:07,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:07,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 01:57:07,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:57:07,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 01:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 01:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:57:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 01:57:08,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-05-04 01:57:08,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-04 01:57:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 01:57:08,559 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1] [2023-05-04 01:57:08,560 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE (1/2) [2023-05-04 01:57:08,563 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:57:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:57:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:57:08,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 01:57:08,568 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:57:08,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-05-04 01:57:08,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 01:57:08,576 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;@25332b5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:57:08,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 01:57:08,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1317869555, now seen corresponding path program 1 times [2023-05-04 01:57:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:08,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928364980] [2023-05-04 01:57:08,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:08,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:57:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928364980] [2023-05-04 01:57:09,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928364980] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:09,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:09,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-05-04 01:57:09,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879876583] [2023-05-04 01:57:09,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:09,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 01:57:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:09,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 01:57:09,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-05-04 01:57:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:09,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:09,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:09,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 01:57:09,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 01:57:09,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 708620531, now seen corresponding path program 1 times [2023-05-04 01:57:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:09,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800939364] [2023-05-04 01:57:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:57:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:11,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800939364] [2023-05-04 01:57:11,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800939364] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:11,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:11,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-05-04 01:57:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419015480] [2023-05-04 01:57:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-04 01:57:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-04 01:57:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-05-04 01:57:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:11,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:11,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:11,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 01:57:11,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:57:12,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 01:57:12,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:12,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1997522658, now seen corresponding path program 1 times [2023-05-04 01:57:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:12,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818982261] [2023-05-04 01:57:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 01:57:13,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 01:57:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 01:57:13,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 01:57:13,045 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 01:57:13,045 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-05-04 01:57:13,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 01:57:13,046 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-05-04 01:57:13,046 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-05-04 01:57:13,047 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 01:57:13,047 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 01:57:13,086 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 01:57:13,092 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:57:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:57:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:57:13,098 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-04 01:57:13,103 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:57:13,112 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-04 01:57:13,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 01:57:13,114 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;@25332b5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:57:13,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 01:57:13,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1863273755, now seen corresponding path program 1 times [2023-05-04 01:57:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:13,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594657375] [2023-05-04 01:57:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 01:57:13,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:13,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594657375] [2023-05-04 01:57:13,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594657375] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:13,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:13,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 01:57:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813223329] [2023-05-04 01:57:13,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:13,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 01:57:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:13,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 01:57:13,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 01:57:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:13,280 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:13,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:13,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:13,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 01:57:13,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash -364182573, now seen corresponding path program 1 times [2023-05-04 01:57:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:13,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294651277] [2023-05-04 01:57:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 01:57:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294651277] [2023-05-04 01:57:13,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294651277] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:13,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:13,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-05-04 01:57:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505333699] [2023-05-04 01:57:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:13,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 01:57:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 01:57:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-05-04 01:57:13,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:13,873 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:13,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:13,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:13,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 01:57:14,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 01:57:14,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1605111021, now seen corresponding path program 1 times [2023-05-04 01:57:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:14,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859289893] [2023-05-04 01:57:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:14,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 01:57:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:16,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859289893] [2023-05-04 01:57:16,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859289893] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:16,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:16,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-05-04 01:57:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832986405] [2023-05-04 01:57:16,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:16,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-04 01:57:16,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-04 01:57:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-05-04 01:57:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:16,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:16,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:16,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:16,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 01:57:16,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:18,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 01:57:18,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:18,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1813800222, now seen corresponding path program 1 times [2023-05-04 01:57:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:18,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911898112] [2023-05-04 01:57:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 01:57:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911898112] [2023-05-04 01:57:19,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911898112] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:19,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:19,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 01:57:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508114278] [2023-05-04 01:57:19,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:19,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 01:57:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:19,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 01:57:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 01:57:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:19,356 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:19,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:19,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:19,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:19,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:57:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 01:57:20,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 01:57:20,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:57:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash -867569140, now seen corresponding path program 1 times [2023-05-04 01:57:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:20,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117468097] [2023-05-04 01:57:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 01:57:20,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 01:57:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 01:57:20,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 01:57:20,285 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 01:57:20,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-05-04 01:57:20,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 01:57:20,286 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-05-04 01:57:20,286 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-05-04 01:57:20,287 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 01:57:20,287 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-05-04 01:57:20,328 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 01:57:20,331 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:57:20,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:57:20,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:57:20,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 01:57:20,348 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:57:20,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-05-04 01:57:20,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-05-04 01:57:20,358 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;@25332b5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:57:20,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 01:57:20,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2066513366, now seen corresponding path program 1 times [2023-05-04 01:57:20,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:20,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043442435] [2023-05-04 01:57:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:20,536 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-04 01:57:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:20,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043442435] [2023-05-04 01:57:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043442435] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:20,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:20,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 01:57:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171630722] [2023-05-04 01:57:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 01:57:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 01:57:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 01:57:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:20,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:20,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:20,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:20,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-04 01:57:20,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1258751249, now seen corresponding path program 1 times [2023-05-04 01:57:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:20,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402581393] [2023-05-04 01:57:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 01:57:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402581393] [2023-05-04 01:57:24,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402581393] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:57:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301859442] [2023-05-04 01:57:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:57:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:57:24,728 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-04 01:57:24,748 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-04 01:57:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:24,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 70 conjunts are in the unsatisfiable core [2023-05-04 01:57:24,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:57:26,552 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-05-04 01:57:26,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2023-05-04 01:57:26,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:26,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:26,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:26,779 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:26,822 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:26,901 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-05-04 01:57:26,901 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 97 [2023-05-04 01:57:27,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 01:57:27,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:27,150 INFO L244 Elim1Store]: Index analysis took 101 ms [2023-05-04 01:57:27,221 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-05-04 01:57:27,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 99 [2023-05-04 01:57:27,235 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-04 01:57:27,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:27,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 5 [2023-05-04 01:57:27,706 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-04 01:57:28,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 01:57:28,304 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 225 treesize of output 225 [2023-05-04 01:57:28,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 01:57:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-05-04 01:57:28,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 01:57:28,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301859442] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:28,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 01:57:28,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 25 [2023-05-04 01:57:28,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755043920] [2023-05-04 01:57:28,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:28,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 01:57:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 01:57:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-05-04 01:57:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:28,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:28,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:28,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:28,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:29,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:29,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-05-04 01:57:29,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-04 01:57:29,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1962689115, now seen corresponding path program 1 times [2023-05-04 01:57:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:29,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797439496] [2023-05-04 01:57:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-05-04 01:57:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:30,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797439496] [2023-05-04 01:57:30,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797439496] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:30,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:30,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-05-04 01:57:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490813544] [2023-05-04 01:57:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:30,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 01:57:30,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 01:57:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-05-04 01:57:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:30,167 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:30,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:30,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:30,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:30,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-05-04 01:57:31,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1163448715, now seen corresponding path program 1 times [2023-05-04 01:57:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:31,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452848106] [2023-05-04 01:57:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 01:57:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452848106] [2023-05-04 01:57:31,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452848106] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:31,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:57:31,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-05-04 01:57:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448259249] [2023-05-04 01:57:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:31,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 01:57:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:31,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 01:57:31,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-05-04 01:57:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:31,759 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:31,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:31,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:31,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:31,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:31,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:32,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-04 01:57:32,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1296847569, now seen corresponding path program 1 times [2023-05-04 01:57:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:32,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250765398] [2023-05-04 01:57:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 01:57:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:39,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250765398] [2023-05-04 01:57:39,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250765398] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:57:39,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203231673] [2023-05-04 01:57:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:39,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:57:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:57:39,184 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:57:39,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 01:57:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:39,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 68 conjunts are in the unsatisfiable core [2023-05-04 01:57:39,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:57:42,394 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-05-04 01:57:42,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-05-04 01:57:42,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:42,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:42,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:57:42,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:42,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:42,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:42,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:42,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 74 treesize of output 69 [2023-05-04 01:57:42,629 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-04 01:57:42,902 INFO L244 Elim1Store]: Index analysis took 147 ms [2023-05-04 01:57:43,050 INFO L356 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2023-05-04 01:57:43,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 112 treesize of output 117 [2023-05-04 01:57:43,201 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-04 01:57:43,240 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-04 01:57:43,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:57:43,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 5 [2023-05-04 01:57:43,581 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-04 01:57:43,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 01:57:43,961 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 102 treesize of output 96 [2023-05-04 01:57:44,020 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-04 01:57:44,039 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-04 01:57:44,050 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-04 01:57:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-05-04 01:57:44,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 01:57:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203231673] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:57:44,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 01:57:44,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [25] total 32 [2023-05-04 01:57:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272798739] [2023-05-04 01:57:44,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:57:44,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 01:57:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 01:57:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2023-05-04 01:57:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:44,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:44,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:44,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:44,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:44,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:44,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:44,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:44,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 01:57:44,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:57:44,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:57:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:57:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 11749172, now seen corresponding path program 1 times [2023-05-04 01:57:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:57:44,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517954927] [2023-05-04 01:57:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:57:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 01:57:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:57:49,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517954927] [2023-05-04 01:57:49,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517954927] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:57:49,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499234139] [2023-05-04 01:57:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:57:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:57:49,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:57:49,281 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:57:49,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 01:57:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:57:49,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 46 conjunts are in the unsatisfiable core [2023-05-04 01:57:49,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:57:49,749 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 01:57:49,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 01:57:51,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 01:57:52,366 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 17 treesize of output 9 [2023-05-04 01:57:53,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 01:57:54,156 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 17 treesize of output 9 [2023-05-04 01:57:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 01:57:54,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 01:57:55,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1109) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0)) is different from false [2023-05-04 01:57:55,641 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 37 treesize of output 29 [2023-05-04 01:57:55,660 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 5 [2023-05-04 01:57:58,114 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 10 treesize of output 6 [2023-05-04 01:57:58,759 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 01:57:58,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 01:57:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-05-04 01:57:58,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499234139] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 01:57:58,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 01:57:58,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 14] total 43 [2023-05-04 01:57:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107876368] [2023-05-04 01:57:58,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 01:57:58,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-05-04 01:57:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:57:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-05-04 01:57:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1526, Unknown=1, NotChecked=80, Total=1806 [2023-05-04 01:57:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:58,963 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:57:58,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.674418604651163) internal successors, (287), 43 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:57:58,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:57:58,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:58,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:58,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:57:58,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:57:58,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:58:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:58:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:58:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:58:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 01:58:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 01:58:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 01:58:05,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-04 01:58:05,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:58:05,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:58:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:58:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash -566677719, now seen corresponding path program 1 times [2023-05-04 01:58:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:58:05,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007630349] [2023-05-04 01:58:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:58:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:58:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:58:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 01:58:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:58:10,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007630349] [2023-05-04 01:58:10,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007630349] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:58:10,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952647299] [2023-05-04 01:58:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:58:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:58:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:58:10,289 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:58:10,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-04 01:58:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:58:10,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 121 conjunts are in the unsatisfiable core [2023-05-04 01:58:10,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:58:12,593 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-04 01:58:12,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 01:58:13,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 01:58:15,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 01:58:18,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:18,980 INFO L356 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2023-05-04 01:58:18,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 258 [2023-05-04 01:58:19,174 INFO L356 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-05-04 01:58:19,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 279 treesize of output 195 [2023-05-04 01:58:19,473 INFO L356 Elim1Store]: treesize reduction 118, result has 20.8 percent of original size [2023-05-04 01:58:19,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 172 treesize of output 196 [2023-05-04 01:58:19,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:58:19,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:58:19,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:58:19,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 24 treesize of output 14 [2023-05-04 01:58:19,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 24 treesize of output 14 [2023-05-04 01:58:20,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 45 [2023-05-04 01:58:20,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:58:20,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2023-05-04 01:58:20,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-05-04 01:58:20,421 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 59 [2023-05-04 01:58:20,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 01:58:22,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-05-04 01:58:25,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:25,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:25,412 INFO L356 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2023-05-04 01:58:25,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 249 treesize of output 212 [2023-05-04 01:58:25,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:25,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:26,054 INFO L356 Elim1Store]: treesize reduction 153, result has 31.4 percent of original size [2023-05-04 01:58:26,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 198 treesize of output 280 [2023-05-04 01:58:26,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:58:26,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:58:26,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 01:58:27,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:27,505 INFO L356 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-05-04 01:58:27,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 55 [2023-05-04 01:58:27,518 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-04 01:58:27,537 WARN L234 Elim1Store]: Array PQE input equivalent to false [2023-05-04 01:58:27,562 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-04 01:58:27,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:27,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:27,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:58:27,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:27,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:27,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:58:27,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:58:27,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 66 [2023-05-04 01:58:27,823 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-04 01:58:28,003 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-05-04 01:58:28,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 182 treesize of output 235 [2023-05-04 01:58:33,131 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-05-04 01:58:33,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 103 [2023-05-04 01:58:33,459 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-05-04 01:58:33,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 23 [2023-05-04 01:58:33,580 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-04 01:58:33,580 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 3 [2023-05-04 01:58:33,742 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-05-04 01:58:33,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 32 [2023-05-04 01:58:35,244 INFO L356 Elim1Store]: treesize reduction 414, result has 24.2 percent of original size [2023-05-04 01:58:35,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 230 treesize of output 725 [2023-05-04 01:58:46,801 INFO L356 Elim1Store]: treesize reduction 231, result has 32.1 percent of original size [2023-05-04 01:58:46,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 31682 treesize of output 31702 [2023-05-04 01:58:50,242 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 30 treesize of output 28 [2023-05-04 01:58:50,363 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-04 01:58:50,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 145 [2023-05-04 01:58:50,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-05-04 01:58:50,899 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-05-04 01:58:50,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 287 [2023-05-04 01:58:51,201 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 5 [2023-05-04 01:58:52,113 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-05-04 01:58:52,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 134 [2023-05-04 01:58:52,445 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-05-04 01:58:52,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 15 [2023-05-04 01:58:52,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 145 [2023-05-04 01:58:53,027 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-05-04 01:58:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 01:58:58,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 01:59:01,705 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1228 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (v_ArrVal_1225 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (or (not (= 0 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296))) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|))) (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0)) is different from false [2023-05-04 01:59:02,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1228 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (v_ArrVal_1225 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (not (= (mod (select (select (store (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) is different from false [2023-05-04 01:59:03,138 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of3ForFork0_inc_~inc__v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| 1)) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1216) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_inc_~inc__vn~0#1|)) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1213) |c_~#value~0.base| v_ArrVal_1219) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (not (= (mod (select (select (store (store (store .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))))) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse2 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= (mod (select (select (store (store (store .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) .cse0))) is different from false [2023-05-04 01:59:03,307 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread2of3ForFork0_inc_~inc__v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| 1)) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1216) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_inc_~inc__v~0#1| 1))) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1213) |c_~#value~0.base| v_ArrVal_1219) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= (mod (select (select (store (store (store .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|))))) (or (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse2 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= (mod (select (select (store (store (store .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) .cse0))) is different from false [2023-05-04 01:59:03,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_thr1Thread2of3ForFork0_inc_#t~mem8#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_1208 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= (mod (select (select (store (store (store .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse1 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))))) (or (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse2 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| 1)) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1216) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_inc_#t~mem8#1| 1))) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1213) |c_~#value~0.base| v_ArrVal_1219) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (not (= (mod (select (select (store (store (store .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse2 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) (not .cse0)))) is different from false [2023-05-04 01:59:03,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| 1)) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1216) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1213) |c_~#value~0.base| v_ArrVal_1219) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (not (= (mod (select (select (store (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) is different from false [2023-05-04 01:59:04,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| 1)) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1216) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_1213) |c_~#value~0.base| v_ArrVal_1219) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= 0 (mod (select (select (store (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296)))))) is different from false [2023-05-04 01:59:04,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1207 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| Int) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1220 (Array Int Int)) (v_ArrVal_1230 (Array Int Int)) (|thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| Int) (|thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| Int) (|v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int)) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1207))) (store (store (store .cse1 |c_~#inc_flag~0.base| (store (select .cse1 |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| 1)) |c_~#value~0.base| (store (select (store .cse1 |c_~#inc_flag~0.base| v_ArrVal_1216) |c_~#value~0.base|) |c_~#value~0.offset| (+ (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 1))) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store .cse1 |c_~#inc_flag~0.base| v_ArrVal_1213) |c_~#value~0.base| v_ArrVal_1219) |thr1Thread2of3ForFork0_inc_~#inc__casret~0#1.base|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1220))) (or (not (= (mod (select (select (store (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| (store (select .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.offset_9| 1)) |c_~#value~0.base| v_ArrVal_1230) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base| (store (select (store (store .cse0 |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_1228) |c_~#value~0.base| v_ArrVal_1225) |thr1Thread3of3ForFork0_dec_~#dec__casret~0#1.base|) 0 1)) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)) (< |c_~#dec_flag~0.base| |v_thr1Thread3of3ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0)))) is different from false [2023-05-04 01:59:09,156 INFO L173 IndexEqualityManager]: detected equality via solver