/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 11:04:34,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 11:04:34,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 11:04:34,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 11:04:34,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 11:04:34,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 11:04:34,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 11:04:34,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 11:04:34,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 11:04:34,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 11:04:34,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 11:04:34,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 11:04:34,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 11:04:34,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 11:04:34,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 11:04:34,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 11:04:34,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 11:04:34,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 11:04:34,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 11:04:34,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 11:04:34,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 11:04:34,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 11:04:34,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 11:04:34,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 11:04:34,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 11:04:34,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 11:04:34,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 11:04:34,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 11:04:34,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 11:04:34,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 11:04:34,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 11:04:34,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 11:04:34,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 11:04:34,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 11:04:34,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 11:04:34,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 11:04:34,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 11:04:34,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 11:04:34,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 11:04:34,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 11:04:34,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 11:04:34,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 11:04:35,013 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 11:04:35,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 11:04:35,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 11:04:35,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 11:04:35,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 11:04:35,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 11:04:35,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 11:04:35,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 11:04:35,015 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 11:04:35,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 11:04:35,016 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 11:04:35,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 11:04:35,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 11:04:35,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:04:35,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 11:04:35,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 11:04:35,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 11:04:35,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 11:04:35,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 11:04:35,019 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 11:04:35,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 11:04:35,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 11:04:35,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 11:04:35,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 11:04:35,223 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 11:04:35,224 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 11:04:35,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2023-05-04 11:04:35,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313322d30/ab668e55bc1c4c33abe29d0e083429ea/FLAGa054350f3 [2023-05-04 11:04:35,618 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 11:04:35,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2023-05-04 11:04:35,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313322d30/ab668e55bc1c4c33abe29d0e083429ea/FLAGa054350f3 [2023-05-04 11:04:35,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313322d30/ab668e55bc1c4c33abe29d0e083429ea [2023-05-04 11:04:35,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 11:04:35,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 11:04:35,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 11:04:35,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 11:04:35,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 11:04:35,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:04:35" (1/1) ... [2023-05-04 11:04:35,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b97597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:35, skipping insertion in model container [2023-05-04 11:04:35,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:04:35" (1/1) ... [2023-05-04 11:04:35,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 11:04:35,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 11:04:36,039 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-lit/sssc12_variant.i[46865,46878] [2023-05-04 11:04:36,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:04:36,058 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 11:04:36,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-lit/sssc12_variant.i[46865,46878] [2023-05-04 11:04:36,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:04:36,137 INFO L208 MainTranslator]: Completed translation [2023-05-04 11:04:36,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36 WrapperNode [2023-05-04 11:04:36,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 11:04:36,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 11:04:36,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 11:04:36,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 11:04:36,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,174 INFO L138 Inliner]: procedures = 275, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2023-05-04 11:04:36,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 11:04:36,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 11:04:36,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 11:04:36,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 11:04:36,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,198 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 11:04:36,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 11:04:36,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 11:04:36,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 11:04:36,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (1/1) ... [2023-05-04 11:04:36,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:04:36,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:04:36,262 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 11:04:36,277 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 11:04:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 11:04:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-05-04 11:04:36,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-05-04 11:04:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 11:04:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 11:04:36,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 11:04:36,312 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 11:04:36,419 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 11:04:36,420 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 11:04:36,585 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 11:04:36,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 11:04:36,617 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 11:04:36,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:04:36 BoogieIcfgContainer [2023-05-04 11:04:36,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 11:04:36,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 11:04:36,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 11:04:36,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 11:04:36,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 11:04:35" (1/3) ... [2023-05-04 11:04:36,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133089c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:04:36, skipping insertion in model container [2023-05-04 11:04:36,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:04:36" (2/3) ... [2023-05-04 11:04:36,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133089c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:04:36, skipping insertion in model container [2023-05-04 11:04:36,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:04:36" (3/3) ... [2023-05-04 11:04:36,624 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2023-05-04 11:04:36,629 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 11:04:36,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 11:04:36,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 11:04:36,635 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 11:04:36,674 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 11:04:36,706 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:04:36,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 11:04:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:04:36,708 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 11:04:36,712 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 11:04:36,732 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 11:04:36,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 11:04:36,747 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;@7d73e625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:04:36,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 11:04:36,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 11:04:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1781068668, now seen corresponding path program 1 times [2023-05-04 11:04:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59842040] [2023-05-04 11:04:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:37,138 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 11:04:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59842040] [2023-05-04 11:04:37,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59842040] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:37,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:37,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 11:04:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927946083] [2023-05-04 11:04:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:37,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 11:04:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:37,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 11:04:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 11:04:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 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 11:04:37,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 11:04:37,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 11:04:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash -38258333, now seen corresponding path program 1 times [2023-05-04 11:04:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:37,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929640164] [2023-05-04 11:04:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:37,384 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 11:04:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:37,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929640164] [2023-05-04 11:04:37,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929640164] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:37,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:37,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-04 11:04:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048158171] [2023-05-04 11:04:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:37,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 11:04:37,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 11:04:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-05-04 11:04:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:37,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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 11:04:37,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 11:04:37,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 11:04:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash -864663039, now seen corresponding path program 1 times [2023-05-04 11:04:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:37,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327522724] [2023-05-04 11:04:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:37,686 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 11:04:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:37,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327522724] [2023-05-04 11:04:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327522724] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:37,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:37,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 11:04:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990316986] [2023-05-04 11:04:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 11:04:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 11:04:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:04:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 11:04:37,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:37,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 11:04:37,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 11:04:37,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 11:04:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1179572577, now seen corresponding path program 1 times [2023-05-04 11:04:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:37,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202649530] [2023-05-04 11:04:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 11:04:37,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 11:04:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 11:04:37,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 11:04:37,873 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 11:04:37,874 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-05-04 11:04:37,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 11:04:37,885 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-05-04 11:04:37,886 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2023-05-04 11:04:37,887 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 11:04:37,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 11:04:37,910 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 11:04:37,914 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:04:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 11:04:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:04:37,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 11:04:37,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 11:04:37,992 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 11:04:37,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread2of2ForFork0 ======== [2023-05-04 11:04:37,995 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;@7d73e625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:04:37,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 11:04:38,106 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1644000995, now seen corresponding path program 1 times [2023-05-04 11:04:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:38,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601822967] [2023-05-04 11:04:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:38,132 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 11:04:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:38,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601822967] [2023-05-04 11:04:38,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601822967] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:38,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:38,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 11:04:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924625523] [2023-05-04 11:04:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:38,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 11:04:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:38,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 11:04:38,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 11:04:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,134 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:38,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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 11:04:38,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 11:04:38,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash 467289374, now seen corresponding path program 1 times [2023-05-04 11:04:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:38,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804536836] [2023-05-04 11:04:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 11:04:38,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:38,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804536836] [2023-05-04 11:04:38,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804536836] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:38,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:38,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 11:04:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052956194] [2023-05-04 11:04:38,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:38,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 11:04:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:38,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 11:04:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:04:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:38,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 11:04:38,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:38,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 11:04:38,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1435522104, now seen corresponding path program 1 times [2023-05-04 11:04:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:38,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388154110] [2023-05-04 11:04:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-05-04 11:04:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:38,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388154110] [2023-05-04 11:04:38,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388154110] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:38,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:38,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-04 11:04:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247675900] [2023-05-04 11:04:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:38,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 11:04:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 11:04:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-05-04 11:04:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:38,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 11:04:38,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:38,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:38,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 11:04:38,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2099670745, now seen corresponding path program 1 times [2023-05-04 11:04:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:38,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073451506] [2023-05-04 11:04:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-05-04 11:04:38,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:38,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073451506] [2023-05-04 11:04:38,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073451506] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:38,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:38,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 11:04:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744109791] [2023-05-04 11:04:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:38,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 11:04:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:38,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 11:04:38,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:04:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,841 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:38,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 11:04:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:38,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 11:04:39,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1363495923, now seen corresponding path program 1 times [2023-05-04 11:04:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:39,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370117145] [2023-05-04 11:04:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-05-04 11:04:39,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:39,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370117145] [2023-05-04 11:04:39,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370117145] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:04:39,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:04:39,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 11:04:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474671451] [2023-05-04 11:04:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:04:39,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 11:04:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:39,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 11:04:39,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-05-04 11:04:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,134 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:39,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 11:04:39,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:39,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:39,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:39,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 11:04:39,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2072631043, now seen corresponding path program 1 times [2023-05-04 11:04:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:39,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833404948] [2023-05-04 11:04:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-04 11:04:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833404948] [2023-05-04 11:04:39,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833404948] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:04:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242176599] [2023-05-04 11:04:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:04:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:04:39,365 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 11:04:39,409 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 11:04:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:39,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 11:04:39,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:04:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-04 11:04:39,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:04:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-04 11:04:39,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242176599] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:04:39,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:04:39,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-05-04 11:04:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284882299] [2023-05-04 11:04:39,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:04:39,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 11:04:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 11:04:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-05-04 11:04:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:39,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.545454545454547) internal successors, (226), 11 states have internal predecessors, (226), 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 11:04:39,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:39,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:39,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:39,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:39,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:04:39,993 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 11:04:40,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:04:40,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -630246415, now seen corresponding path program 1 times [2023-05-04 11:04:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:40,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074758208] [2023-05-04 11:04:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 180 proven. 115 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-04 11:04:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074758208] [2023-05-04 11:04:40,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074758208] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:04:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869405405] [2023-05-04 11:04:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:40,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:04:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:04:40,896 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 11:04:40,921 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 11:04:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:41,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-04 11:04:41,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:04:41,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 11:04:41,296 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:41,296 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:41,302 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 23 treesize of output 7 [2023-05-04 11:04:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 204 proven. 91 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-04 11:04:41,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:04:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 190 proven. 105 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-04 11:04:41,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869405405] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:04:41,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:04:41,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2023-05-04 11:04:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911035769] [2023-05-04 11:04:41,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:04:41,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 11:04:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 11:04:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2023-05-04 11:04:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:41,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:41,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.9375) internal successors, (382), 32 states have internal predecessors, (382), 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 11:04:41,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:41,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:41,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:41,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:41,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:41,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:04:41,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:04:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-05-04 11:04:43,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 11:04:44,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:04:44,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 663349380, now seen corresponding path program 2 times [2023-05-04 11:04:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:44,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674010534] [2023-05-04 11:04:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:04:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 270 proven. 395 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-04 11:04:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:04:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674010534] [2023-05-04 11:04:45,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674010534] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:04:45,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611153211] [2023-05-04 11:04:45,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:04:45,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:04:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:04:45,881 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 11:04:45,882 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 11:04:46,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:04:46,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:04:46,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-04 11:04:46,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:04:46,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 11:04:46,802 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:46,802 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:46,818 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:46,819 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:46,900 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:46,900 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:46,915 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:46,916 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:46,997 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:46,997 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:47,038 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:47,039 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:47,210 INFO L356 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-05-04 11:04:47,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2023-05-04 11:04:47,289 INFO L356 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-05-04 11:04:47,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 65 [2023-05-04 11:04:47,358 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-05-04 11:04:47,358 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 1 case distinctions, treesize of input 27 treesize of output 34 [2023-05-04 11:04:47,402 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-05-04 11:04:47,402 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 1 case distinctions, treesize of input 35 treesize of output 42 [2023-05-04 11:04:47,494 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:04:47,494 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:04:47,499 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 23 treesize of output 7 [2023-05-04 11:04:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 27 proven. 664 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 11:04:47,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:04:49,018 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_44| Int) (v_ArrVal_495 Int)) (or (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) |v_thrThread1of2ForFork0_~c~0#1_44|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_44| 4) c_~data~0.offset) v_ArrVal_495) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) is different from false [2023-05-04 11:04:49,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-05-04 11:04:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 286 proven. 321 refuted. 12 times theorem prover too weak. 10 trivial. 72 not checked. [2023-05-04 11:04:52,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611153211] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:04:52,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:04:52,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 28] total 68 [2023-05-04 11:04:52,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906110743] [2023-05-04 11:04:52,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:04:52,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-05-04 11:04:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:04:52,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-05-04 11:04:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3796, Unknown=6, NotChecked=130, Total=4556 [2023-05-04 11:04:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:52,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:04:52,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 10.544117647058824) internal successors, (717), 68 states have internal predecessors, (717), 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 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2023-05-04 11:04:52,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-05-04 11:04:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-05-04 11:04:59,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-05-04 11:04:59,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-04 11:04:59,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:04:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:04:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1741935377, now seen corresponding path program 3 times [2023-05-04 11:04:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:04:59,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139467730] [2023-05-04 11:04:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:04:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:04:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 2318 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2023-05-04 11:05:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:00,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139467730] [2023-05-04 11:05:00,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139467730] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:00,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:00,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-05-04 11:05:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048831560] [2023-05-04 11:05:00,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:00,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 11:05:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 11:05:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2023-05-04 11:05:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:00,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:00,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.166666666666668) internal successors, (363), 18 states have internal predecessors, (363), 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 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2023-05-04 11:05:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-05-04 11:05:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:00,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 11:05:00,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:05:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1035025768, now seen corresponding path program 4 times [2023-05-04 11:05:00,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:00,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580003744] [2023-05-04 11:05:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:00,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1433 proven. 169 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-05-04 11:05:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580003744] [2023-05-04 11:05:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580003744] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:05:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762557663] [2023-05-04 11:05:00,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 11:05:00,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:05:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:05:00,911 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:05:00,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 11:05:01,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 11:05:01,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:05:01,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 13 conjunts are in the unsatisfiable core [2023-05-04 11:05:01,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:05:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1526 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-05-04 11:05:01,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 11:05:01,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762557663] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:01,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 11:05:01,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 21 [2023-05-04 11:05:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610951408] [2023-05-04 11:05:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:01,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-04 11:05:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:01,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-04 11:05:01,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2023-05-04 11:05:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:01,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 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 11:05:01,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:01,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:05:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:10,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 11:05:10,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:05:10,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:05:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1423568721, now seen corresponding path program 1 times [2023-05-04 11:05:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:10,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700576106] [2023-05-04 11:05:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-05-04 11:05:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:10,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700576106] [2023-05-04 11:05:10,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700576106] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:05:10,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217745110] [2023-05-04 11:05:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:05:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:05:10,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:05:10,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 11:05:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:10,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 27 conjunts are in the unsatisfiable core [2023-05-04 11:05:10,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:05:10,719 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 6 treesize of output 5 [2023-05-04 11:05:10,747 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:05:10,747 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 11:05:10,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 11:05:10,960 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 18 treesize of output 20 [2023-05-04 11:05:10,963 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 23 treesize of output 7 [2023-05-04 11:05:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 1 proven. 63 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2023-05-04 11:05:10,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:05:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2023-05-04 11:05:11,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217745110] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:05:11,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:05:11,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 19 [2023-05-04 11:05:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738469095] [2023-05-04 11:05:11,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:05:11,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 11:05:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:11,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 11:05:11,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-05-04 11:05:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:11,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:11,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.526315789473685) internal successors, (162), 19 states have internal predecessors, (162), 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 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 193 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:11,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 11:05:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:05:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 11:05:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:05:14,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 11:05:14,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:05:14,245 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:05:14,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:14,247 INFO L85 PathProgramCache]: Analyzing trace with hash -415422541, now seen corresponding path program 5 times [2023-05-04 11:05:14,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:14,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787862791] [2023-05-04 11:05:14,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 6 proven. 381 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 11:05:16,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787862791] [2023-05-04 11:05:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787862791] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:05:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182550068] [2023-05-04 11:05:16,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-04 11:05:16,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:05:16,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:05:16,204 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:05:16,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 11:05:17,681 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-05-04 11:05:17,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:05:17,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 67 conjunts are in the unsatisfiable core [2023-05-04 11:05:17,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:05:17,694 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 6 treesize of output 5 [2023-05-04 11:05:17,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:05:17,709 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 11:05:17,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 11:05:18,001 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 18 treesize of output 20 [2023-05-04 11:05:18,023 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,023 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,036 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,036 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,128 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,129 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,141 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,141 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,181 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,181 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,193 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,194 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,232 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,232 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,244 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,244 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,282 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,282 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,295 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,295 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,334 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,334 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,346 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,346 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,398 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-05-04 11:05:18,398 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 1 case distinctions, treesize of input 27 treesize of output 26 [2023-05-04 11:05:18,402 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 23 treesize of output 7 [2023-05-04 11:05:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 15 proven. 372 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 11:05:18,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:05:18,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_80| Int)) (or (forall ((v_ArrVal_1146 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2023-05-04 11:08:50,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2023-05-04 11:08:52,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_83| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (forall ((v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2023-05-04 11:08:54,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1131 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (v_ArrVal_1146 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (= (select (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))))) is different from false [2023-05-04 11:08:56,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_84| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_84| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (forall ((v_ArrVal_1131 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (v_ArrVal_1146 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |v_thrThread1of2ForFork0_~c~0#1_84| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))) (= (select (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_84| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2023-05-04 11:08:58,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1131 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (|v_thrThread1of2ForFork0_~c~0#1_84| Int) (v_ArrVal_1146 Int) (v_ArrVal_1127 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1127) (+ (* |v_thrThread1of2ForFork0_~c~0#1_84| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |v_thrThread1of2ForFork0_~c~0#1_84| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_84| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2023-05-04 11:09:00,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_85| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_85| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (forall ((v_ArrVal_1131 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (|v_thrThread1of2ForFork0_~c~0#1_84| Int) (v_ArrVal_1146 Int) (v_ArrVal_1127 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |v_thrThread1of2ForFork0_~c~0#1_84| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_84| (+ |v_thrThread1of2ForFork0_~c~0#1_85| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_85| 4) c_~data~0.offset) v_ArrVal_1127) (+ (* |v_thrThread1of2ForFork0_~c~0#1_84| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2023-05-04 11:09:07,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1131 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (|v_thrThread1of2ForFork0_~c~0#1_84| Int) (v_ArrVal_1146 Int) (|v_thrThread1of2ForFork0_~c~0#1_85| Int) (v_ArrVal_1127 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_85| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |v_thrThread1of2ForFork0_~c~0#1_84| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_84| (+ |v_thrThread1of2ForFork0_~c~0#1_85| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_85| 4) c_~data~0.offset) v_ArrVal_1127) (+ (* |v_thrThread1of2ForFork0_~c~0#1_84| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2023-05-04 11:09:09,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (|v_thrThread1of2ForFork0_~c~0#1_84| Int) (v_ArrVal_1146 Int) (|v_thrThread1of2ForFork0_~c~0#1_85| Int) (v_ArrVal_1127 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_85| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (= (select (store (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1123) (+ (* |v_thrThread1of2ForFork0_~c~0#1_85| 4) c_~data~0.offset) v_ArrVal_1127) (+ (* |v_thrThread1of2ForFork0_~c~0#1_84| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |v_thrThread1of2ForFork0_~c~0#1_84| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_84| (+ |v_thrThread1of2ForFork0_~c~0#1_85| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))))) is different from false [2023-05-04 11:09:11,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1120 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1134 Int) (v_ArrVal_1144 Int) (|v_thrThread1of2ForFork0_~c~0#1_83| Int) (|v_thrThread1of2ForFork0_~c~0#1_84| Int) (v_ArrVal_1146 Int) (|v_thrThread1of2ForFork0_~c~0#1_85| Int) (v_ArrVal_1127 Int) (v_ArrVal_1138 Int) (|v_thrThread1of2ForFork0_~c~0#1_80| Int) (|v_thrThread1of2ForFork0_~c~0#1_81| Int) (|v_thrThread1of2ForFork0_~c~0#1_82| Int)) (or (not (<= |v_thrThread1of2ForFork0_~c~0#1_85| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (= (select (store (store (store (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1120) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_1123) (+ (* |v_thrThread1of2ForFork0_~c~0#1_85| 4) c_~data~0.offset) v_ArrVal_1127) (+ (* |v_thrThread1of2ForFork0_~c~0#1_84| 4) c_~data~0.offset) v_ArrVal_1131) (+ (* |v_thrThread1of2ForFork0_~c~0#1_83| 4) c_~data~0.offset) v_ArrVal_1134) (+ (* |v_thrThread1of2ForFork0_~c~0#1_82| 4) c_~data~0.offset) v_ArrVal_1138) (+ (* |v_thrThread1of2ForFork0_~c~0#1_81| 4) c_~data~0.offset) v_ArrVal_1144) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_80| 4)) v_ArrVal_1146) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= |v_thrThread1of2ForFork0_~c~0#1_83| (+ |v_thrThread1of2ForFork0_~c~0#1_84| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_82| (+ |v_thrThread1of2ForFork0_~c~0#1_83| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_81| (+ |v_thrThread1of2ForFork0_~c~0#1_82| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_84| (+ |v_thrThread1of2ForFork0_~c~0#1_85| 1))) (not (<= |v_thrThread1of2ForFork0_~c~0#1_80| (+ |v_thrThread1of2ForFork0_~c~0#1_81| 1))))) is different from false [2023-05-04 11:09:11,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:09:11,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 76 [2023-05-04 11:09:11,707 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 140 treesize of output 136 [2023-05-04 11:09:11,733 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 1379326 treesize of output 1376248 [2023-05-04 11:09:47,337 WARN L233 SmtUtils]: Spent 31.69s on a formula simplification. DAG size of input: 1579 DAG size of output: 1579 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 11:09:47,441 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 5517298 treesize of output 5505010 [2023-05-04 11:10:03,405 WARN L233 SmtUtils]: Spent 15.96s on a formula simplification that was a NOOP. DAG size: 2997 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 11:11:17,623 WARN L233 SmtUtils]: Spent 21.61s on a formula simplification. DAG size of input: 1140 DAG size of output: 1140 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 11:11:38,994 WARN L233 SmtUtils]: Spent 15.27s on a formula simplification. DAG size of input: 693 DAG size of output: 693 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 11:12:11,661 WARN L233 SmtUtils]: Spent 10.01s on a formula simplification. DAG size of input: 691 DAG size of output: 691 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-05-04 11:19:08,393 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 11:19:08,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:08,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:08,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-05-04 11:19:08,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:08,437 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:08,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-04 11:19:08,612 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 216 with TraceHistMax 9,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-05-04 11:19:08,614 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 11:19:08,614 INFO L307 ceAbstractionStarter]: Result for error location thrThread2of2ForFork0 was TIMEOUT (1/3) [2023-05-04 11:19:08,615 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-05-04 11:19:08,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 11:19:08,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 11:19:08 BasicIcfg [2023-05-04 11:19:08,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 11:19:08,617 INFO L158 Benchmark]: Toolchain (without parser) took 872960.66ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 136.5MB in the beginning and 538.1MB in the end (delta: -401.6MB). Peak memory consumption was 836.8MB. Max. memory is 8.0GB. [2023-05-04 11:19:08,617 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 190.8MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 11:19:08,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.83ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 148.4MB in the end (delta: -12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-05-04 11:19:08,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.97ms. Allocated memory is still 190.8MB. Free memory was 148.4MB in the beginning and 146.0MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 11:19:08,618 INFO L158 Benchmark]: Boogie Preprocessor took 26.10ms. Allocated memory is still 190.8MB. Free memory was 146.0MB in the beginning and 144.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 11:19:08,618 INFO L158 Benchmark]: RCFGBuilder took 417.83ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 129.0MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-05-04 11:19:08,618 INFO L158 Benchmark]: TraceAbstraction took 871996.79ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 128.0MB in the beginning and 538.1MB in the end (delta: -410.2MB). Peak memory consumption was 828.5MB. Max. memory is 8.0GB. [2023-05-04 11:19:08,619 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 190.8MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.83ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 148.4MB in the end (delta: -12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.97ms. Allocated memory is still 190.8MB. Free memory was 148.4MB in the beginning and 146.0MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.10ms. Allocated memory is still 190.8MB. Free memory was 146.0MB in the beginning and 144.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 417.83ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 129.0MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 871996.79ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 128.0MB in the beginning and 538.1MB in the end (delta: -410.2MB). Peak memory consumption was 828.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1027, independent: 865, independent conditional: 142, independent unconditional: 723, dependent: 162, dependent conditional: 154, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 142, independent unconditional: 723, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 142, independent unconditional: 723, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 873, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 687, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 687, independent: 668, independent conditional: 0, independent unconditional: 668, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 873, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 687, unknown conditional: 0, unknown unconditional: 687] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 679, Positive conditional cache size: 0, Positive unconditional cache size: 679, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 154 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 86, Number of trivial persistent sets: 81, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 731, independent: 723, independent conditional: 0, independent unconditional: 723, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1027, independent: 865, independent conditional: 142, independent unconditional: 723, dependent: 162, dependent conditional: 154, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 142, independent unconditional: 723, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 142, independent unconditional: 723, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 873, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 873, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 687, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 687, independent: 668, independent conditional: 0, independent unconditional: 668, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 873, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 687, unknown conditional: 0, unknown unconditional: 687] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 679, Positive conditional cache size: 0, Positive unconditional cache size: 679, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 154 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 264919, independent: 224223, independent conditional: 219824, independent unconditional: 4399, dependent: 40696, dependent conditional: 40639, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225112, independent: 224223, independent conditional: 219824, independent unconditional: 4399, dependent: 889, dependent conditional: 832, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 225112, independent: 224223, independent conditional: 219824, independent unconditional: 4399, dependent: 889, dependent conditional: 832, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243203, independent: 224223, independent conditional: 5254, independent unconditional: 218969, dependent: 18980, dependent conditional: 12837, dependent unconditional: 6143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243203, independent: 224223, independent conditional: 5254, independent unconditional: 218969, dependent: 18980, dependent conditional: 10855, dependent unconditional: 8125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243203, independent: 224223, independent conditional: 5254, independent unconditional: 218969, dependent: 18980, dependent conditional: 10855, dependent unconditional: 8125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4307, independent: 3774, independent conditional: 215, independent unconditional: 3559, dependent: 533, dependent conditional: 476, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4307, independent: 3528, independent conditional: 0, independent unconditional: 3528, dependent: 779, dependent conditional: 0, dependent unconditional: 779, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 779, independent: 246, independent conditional: 215, independent unconditional: 31, dependent: 533, dependent conditional: 476, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 779, independent: 246, independent conditional: 215, independent unconditional: 31, dependent: 533, dependent conditional: 476, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1097, independent: 364, independent conditional: 302, independent unconditional: 62, dependent: 733, dependent conditional: 659, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 243203, independent: 220449, independent conditional: 5039, independent unconditional: 215410, dependent: 18447, dependent conditional: 10379, dependent unconditional: 8068, unknown: 4307, unknown conditional: 691, unknown unconditional: 3616] , Statistics on independence cache: Total cache size (in pairs): 4307, Positive cache size: 3774, Positive conditional cache size: 215, Positive unconditional cache size: 3559, Negative cache size: 533, Negative conditional cache size: 476, Negative unconditional cache size: 57, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1982, Maximal queried relation: 8, Independence queries for same thread: 39807 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 3166, Number of trivial persistent sets: 1889, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4456, independent: 4399, independent conditional: 0, independent unconditional: 4399, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 264919, independent: 224223, independent conditional: 219824, independent unconditional: 4399, dependent: 40696, dependent conditional: 40639, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225112, independent: 224223, independent conditional: 219824, independent unconditional: 4399, dependent: 889, dependent conditional: 832, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 225112, independent: 224223, independent conditional: 219824, independent unconditional: 4399, dependent: 889, dependent conditional: 832, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243203, independent: 224223, independent conditional: 5254, independent unconditional: 218969, dependent: 18980, dependent conditional: 12837, dependent unconditional: 6143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243203, independent: 224223, independent conditional: 5254, independent unconditional: 218969, dependent: 18980, dependent conditional: 10855, dependent unconditional: 8125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243203, independent: 224223, independent conditional: 5254, independent unconditional: 218969, dependent: 18980, dependent conditional: 10855, dependent unconditional: 8125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4307, independent: 3774, independent conditional: 215, independent unconditional: 3559, dependent: 533, dependent conditional: 476, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4307, independent: 3528, independent conditional: 0, independent unconditional: 3528, dependent: 779, dependent conditional: 0, dependent unconditional: 779, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 779, independent: 246, independent conditional: 215, independent unconditional: 31, dependent: 533, dependent conditional: 476, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 779, independent: 246, independent conditional: 215, independent unconditional: 31, dependent: 533, dependent conditional: 476, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1097, independent: 364, independent conditional: 302, independent unconditional: 62, dependent: 733, dependent conditional: 659, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 243203, independent: 220449, independent conditional: 5039, independent unconditional: 215410, dependent: 18447, dependent conditional: 10379, dependent unconditional: 8068, unknown: 4307, unknown conditional: 691, unknown unconditional: 3616] , Statistics on independence cache: Total cache size (in pairs): 4307, Positive cache size: 3774, Positive conditional cache size: 215, Positive unconditional cache size: 3559, Negative cache size: 533, Negative conditional cache size: 476, Negative unconditional cache size: 57, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1982, Maximal queried relation: 8, Independence queries for same thread: 39807 - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 216 with TraceHistMax 9,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 116 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thrThread2of2ForFork0 with 1 thread instances CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 870.6s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 20.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 418, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 3597 NumberOfCodeBlocks, 3593 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4483 ConstructedInterpolants, 42 QuantifiedInterpolants, 21527 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2636 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 9560/11689 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown