/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 08:25:04,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 08:25:04,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 08:25:04,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 08:25:04,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 08:25:04,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 08:25:04,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 08:25:04,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 08:25:04,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 08:25:04,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 08:25:04,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 08:25:04,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 08:25:04,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 08:25:04,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 08:25:04,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 08:25:04,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 08:25:04,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 08:25:04,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 08:25:04,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 08:25:04,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 08:25:04,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 08:25:04,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 08:25:04,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 08:25:04,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 08:25:04,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 08:25:04,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 08:25:04,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 08:25:04,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 08:25:04,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 08:25:04,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 08:25:04,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 08:25:04,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 08:25:04,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 08:25:04,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 08:25:04,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 08:25:04,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 08:25:04,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 08:25:04,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 08:25:04,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 08:25:04,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 08:25:04,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 08:25:04,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 08:25:04,349 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 08:25:04,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 08:25:04,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 08:25:04,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 08:25:04,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 08:25:04,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 08:25:04,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 08:25:04,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 08:25:04,351 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 08:25:04,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 08:25:04,352 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 08:25:04,353 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 08:25:04,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 08:25:04,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 08:25:04,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 08:25:04,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 08:25:04,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 08:25:04,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:25:04,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 08:25:04,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 08:25:04,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 08:25:04,357 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 08:25:04,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-04 08:25:04,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 08:25:04,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 08:25:04,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 08:25:04,663 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 08:25:04,664 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 08:25:04,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-05-04 08:25:04,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0021460/4df1f926ea1f4450a4e63b4031d9b379/FLAG3620515d2 [2023-05-04 08:25:05,268 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 08:25:05,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-05-04 08:25:05,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0021460/4df1f926ea1f4450a4e63b4031d9b379/FLAG3620515d2 [2023-05-04 08:25:05,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0021460/4df1f926ea1f4450a4e63b4031d9b379 [2023-05-04 08:25:05,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 08:25:05,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 08:25:05,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 08:25:05,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 08:25:05,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 08:25:05,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:25:05" (1/1) ... [2023-05-04 08:25:05,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d81618c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:05, skipping insertion in model container [2023-05-04 08:25:05,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:25:05" (1/1) ... [2023-05-04 08:25:05,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 08:25:05,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 08:25:06,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2023-05-04 08:25:06,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:25:06,099 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 08:25:06,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2023-05-04 08:25:06,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:25:06,222 INFO L208 MainTranslator]: Completed translation [2023-05-04 08:25:06,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06 WrapperNode [2023-05-04 08:25:06,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 08:25:06,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 08:25:06,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 08:25:06,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 08:25:06,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,293 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2023-05-04 08:25:06,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 08:25:06,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 08:25:06,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 08:25:06,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 08:25:06,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 08:25:06,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 08:25:06,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 08:25:06,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 08:25:06,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (1/1) ... [2023-05-04 08:25:06,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:25:06,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:06,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 08:25:06,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 08:25:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 08:25:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 08:25:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 08:25:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 08:25:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 08:25:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 08:25:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 08:25:06,442 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 08:25:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 08:25:06,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 08:25:06,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 08:25:06,444 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 08:25:06,617 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 08:25:06,618 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 08:25:06,919 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 08:25:06,928 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 08:25:06,929 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-04 08:25:06,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:25:06 BoogieIcfgContainer [2023-05-04 08:25:06,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 08:25:06,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 08:25:06,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 08:25:06,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 08:25:06,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:25:05" (1/3) ... [2023-05-04 08:25:06,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e1392f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:25:06, skipping insertion in model container [2023-05-04 08:25:06,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:06" (2/3) ... [2023-05-04 08:25:06,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e1392f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:25:06, skipping insertion in model container [2023-05-04 08:25:06,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:25:06" (3/3) ... [2023-05-04 08:25:06,944 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-05-04 08:25:06,952 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 08:25:06,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 08:25:06,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 08:25:06,960 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 08:25:07,046 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 08:25:07,087 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:07,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:07,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 08:25:07,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 08:25:07,124 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:07,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 08:25:07,146 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;@10f59391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:07,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:25:07,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1667612508, now seen corresponding path program 1 times [2023-05-04 08:25:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:07,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626426364] [2023-05-04 08:25:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-05-04 08:25:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626426364] [2023-05-04 08:25:08,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626426364] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:08,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548006911] [2023-05-04 08:25:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:08,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:08,287 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:08,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:08,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 08:25:08,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 94888344, now seen corresponding path program 1 times [2023-05-04 08:25:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111138800] [2023-05-04 08:25:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2023-05-04 08:25:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:09,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111138800] [2023-05-04 08:25:09,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111138800] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:09,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409811817] [2023-05-04 08:25:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:09,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:09,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:09,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:09,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 08:25:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:09,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:09,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2023-05-04 08:25:09,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2023-05-04 08:25:10,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409811817] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:10,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:10,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925617873] [2023-05-04 08:25:10,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:10,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:10,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:10,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:10,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:10,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:10,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:10,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 08:25:10,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 649488248, now seen corresponding path program 2 times [2023-05-04 08:25:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:10,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124911418] [2023-05-04 08:25:10,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 350 proven. 1 refuted. 0 times theorem prover too weak. 2213 trivial. 0 not checked. [2023-05-04 08:25:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:10,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124911418] [2023-05-04 08:25:10,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124911418] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41644625] [2023-05-04 08:25:10,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:10,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:10,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:10,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 08:25:11,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:11,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:11,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2023-05-04 08:25:11,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2023-05-04 08:25:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41644625] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:11,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:11,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 08:25:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526639759] [2023-05-04 08:25:11,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:11,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 08:25:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 08:25:11,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 08:25:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:11,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:11,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.947368421052632) internal successors, (246), 19 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:11,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:11,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:11,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:11,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:12,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:12,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2092402500, now seen corresponding path program 1 times [2023-05-04 08:25:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:12,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682901314] [2023-05-04 08:25:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 08:25:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682901314] [2023-05-04 08:25:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682901314] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844890267] [2023-05-04 08:25:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:12,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:12,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:12,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 08:25:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:12,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:25:12,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 08:25:12,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 08:25:12,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844890267] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:12,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:12,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:25:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096358444] [2023-05-04 08:25:12,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:12,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:25:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:25:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:25:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:12,925 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:12,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:13,255 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 08:25:13,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:13,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:13,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1772820415, now seen corresponding path program 2 times [2023-05-04 08:25:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:13,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010575239] [2023-05-04 08:25:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010575239] [2023-05-04 08:25:17,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010575239] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:17,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82164547] [2023-05-04 08:25:17,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:17,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:17,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:17,269 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 08:25:17,291 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 08:25:17,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:17,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:17,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjunts are in the unsatisfiable core [2023-05-04 08:25:17,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:17,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:17,864 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:17,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:17,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:18,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 08:25:18,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:25:18,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-04 08:25:22,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-05-04 08:25:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:23,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:29,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0))) is different from false [2023-05-04 08:25:31,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0))) is different from false [2023-05-04 08:25:33,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1215 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1215)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:25:33,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1215 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1214))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1215))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0))) is different from false [2023-05-04 08:25:33,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 Int) (v_ArrVal_1215 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1212)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1214))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1215))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0))) is different from false [2023-05-04 08:25:33,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 Int) (v_ArrVal_1215 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1212)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1214))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1215))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0))) is different from false [2023-05-04 08:25:33,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1212 Int) (v_ArrVal_1215 Int)) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1212)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1214) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1215) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| 28)))) is different from false [2023-05-04 08:25:33,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1212 Int) (v_ArrVal_1215 Int)) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1211))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1212))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1214) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1215) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| 28)))) is different from false [2023-05-04 08:25:34,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:25:34,663 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 57 treesize of output 53 [2023-05-04 08:25:34,667 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:25:34,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-05-04 08:25:34,721 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:25:34,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:25:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 13 not checked. [2023-05-04 08:25:34,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82164547] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:34,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:34,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 49 [2023-05-04 08:25:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694707184] [2023-05-04 08:25:34,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:34,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-04 08:25:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:34,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-04 08:25:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1473, Unknown=13, NotChecked=680, Total=2352 [2023-05-04 08:25:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:34,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:34,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.6938775510204085) internal successors, (279), 49 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:34,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:34,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:34,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:34,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:34,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:49,466 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 71 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:26:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:26:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:26:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:26:01,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 08:26:01,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:26:01,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:26:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:26:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1052057069, now seen corresponding path program 3 times [2023-05-04 08:26:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:26:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377240894] [2023-05-04 08:26:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:26:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:26:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:27:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:20,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377240894] [2023-05-04 08:27:20,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377240894] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:20,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254554722] [2023-05-04 08:27:20,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:27:20,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:20,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:20,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:20,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 08:27:20,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-05-04 08:27:20,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:20,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 94 conjunts are in the unsatisfiable core [2023-05-04 08:27:20,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:20,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:27:21,333 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:27:21,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:27:21,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:22,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 08:27:22,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-05-04 08:27:23,766 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-04 08:27:24,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-05-04 08:27:26,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-05-04 08:27:27,147 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-04 08:27:28,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2023-05-04 08:27:29,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-05-04 08:27:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:27:29,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:35,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0))) is different from false [2023-05-04 08:27:37,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0))) is different from false [2023-05-04 08:27:39,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:27:42,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:27:44,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:27:46,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0))) is different from false [2023-05-04 08:27:48,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:27:50,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0))) is different from false [2023-05-04 08:27:50,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0))) is different from false [2023-05-04 08:27:52,223 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:27:52,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse0 (select (select |c_#memory_int| |c_~#cache~0.base|) .cse0))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ .cse1 28 |c_~#cache~0.offset|))))) is different from false [2023-05-04 08:27:52,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse1 (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (or (= (select (let ((.cse0 (+ 28 |c_~#cache~0.offset| .cse1))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse0 (select (select |c_#memory_int| |c_~#cache~0.base|) .cse0))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 |c_~#cache~0.offset| .cse1))))) is different from false [2023-05-04 08:27:54,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse0 (+ .cse1 28 |c_~#cache~0.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse0 (select (select |c_#memory_int| |c_~#cache~0.base|) .cse0))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse1 |c_~#cache~0.offset|))))) is different from false [2023-05-04 08:27:54,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1384))) (.cse2 (+ .cse0 28 |c_~#cache~0.offset|))) (store (select (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse2 (select (select .cse1 |c_~#cache~0.base|) .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0)))) is different from false [2023-05-04 08:27:54,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_1384))) (.cse1 (+ .cse2 28 |c_~#cache~0.offset|))) (store (select (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse1 (select (select .cse0 |c_~#cache~0.base|) .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse2 |c_~#cache~0.offset|))))) is different from false [2023-05-04 08:27:56,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse1 28 |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse2 (select .cse0 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse1 |c_~#cache~0.offset|))))) is different from false [2023-05-04 08:27:58,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (or (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 28 |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse1 (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_58|)))) is different from false [2023-05-04 08:28:00,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_58| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 28 |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse1 (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0)))) is different from false [2023-05-04 08:28:02,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1379 Int) (|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_58| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1379)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ .cse2 28 |c_~#cache~0.offset|))) (store (select (store (store .cse0 |c_~#cache~0.base| (store .cse1 (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse3 (select .cse1 .cse3)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse2 |c_~#cache~0.offset|))))) is different from false [2023-05-04 08:28:04,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1379 Int) (|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_58| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse0 |c_~#cache~0.offset|)) (= 0 (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_1379)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ .cse0 28 |c_~#cache~0.offset|))) (store (select (store (store .cse1 |c_~#cache~0.base| (store .cse2 (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse3 (select .cse2 .cse3)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|))))) is different from false [2023-05-04 08:28:07,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1379 Int) (|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_58| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1379)) (.cse2 (+ .cse0 28 |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse1 (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0)))) is different from false [2023-05-04 08:28:09,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1379 Int) (|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (= (select (let ((.cse0 (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1379)) (.cse2 (+ .cse1 28 |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse2 (select .cse0 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse1 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_58| 1)))) is different from false [2023-05-04 08:28:09,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1379 Int) (|v_t_funThread1of1ForFork0_~i~0#1_58| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_58| 28))) (or (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1376))) (let ((.cse1 (store (select .cse0 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1379)) (.cse3 (+ .cse2 28 |c_~#cache~0.offset|))) (store (select (store (store .cse0 |c_~#cache~0.base| (store .cse1 (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_1384)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#cache~0.base|) .cse3 (select .cse1 .cse3)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| (+ 56 .cse2 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_58| 1)))) is different from false [2023-05-04 08:28:10,408 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:10,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:10,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:10,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:10,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:10,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-05-04 08:28:10,417 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:28:10,419 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 78 treesize of output 74 [2023-05-04 08:28:12,529 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:28:12,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:28:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 139 not checked. [2023-05-04 08:28:12,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254554722] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:28:12,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:28:12,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38, 34] total 97 [2023-05-04 08:28:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300725746] [2023-05-04 08:28:12,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:28:12,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-05-04 08:28:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:28:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-05-04 08:28:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=4906, Unknown=25, NotChecked=3818, Total=9312 [2023-05-04 08:28:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:28:12,617 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:28:12,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 5.11340206185567) internal successors, (496), 97 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:28:12,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:28:12,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:28:12,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:28:12,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:28:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:28:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:28:19,903 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 61 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:28:26,234 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 58 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:28:36,645 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 68 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:28:56,176 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 88 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:29:06,738 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 91 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:29:13,583 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 86 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:29:56,855 WARN L233 SmtUtils]: Spent 24.42s on a formula simplification. DAG size of input: 133 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:30:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:30:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 08:30:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-04 08:30:27,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-05-04 08:30:27,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:30:27,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:30:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:30:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1344930039, now seen corresponding path program 4 times [2023-05-04 08:30:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:30:27,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397507962] [2023-05-04 08:30:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:30:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-05-04 08:37:55,465 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 08:37:55,465 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 08:37:56,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 08:37:56,117 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-04 08:37:56,121 INFO L158 Benchmark]: Toolchain (without parser) took 770553.61ms. Allocated memory was 185.6MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 129.6MB in the beginning and 444.4MB in the end (delta: -314.8MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2023-05-04 08:37:56,124 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 185.6MB. Free memory was 148.3MB in the beginning and 148.3MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 08:37:56,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.06ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.4MB in the beginning and 177.3MB in the end (delta: -48.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2023-05-04 08:37:56,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.94ms. Allocated memory is still 223.3MB. Free memory was 177.3MB in the beginning and 174.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 08:37:56,125 INFO L158 Benchmark]: Boogie Preprocessor took 57.56ms. Allocated memory is still 223.3MB. Free memory was 174.3MB in the beginning and 172.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 08:37:56,125 INFO L158 Benchmark]: RCFGBuilder took 579.48ms. Allocated memory is still 223.3MB. Free memory was 172.2MB in the beginning and 150.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 08:37:56,125 INFO L158 Benchmark]: TraceAbstraction took 769186.67ms. Allocated memory was 223.3MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 149.7MB in the beginning and 444.4MB in the end (delta: -294.6MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2023-05-04 08:37:56,133 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.15ms. Allocated memory is still 185.6MB. Free memory was 148.3MB in the beginning and 148.3MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 653.06ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 129.4MB in the beginning and 177.3MB in the end (delta: -48.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.94ms. Allocated memory is still 223.3MB. Free memory was 177.3MB in the beginning and 174.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.56ms. Allocated memory is still 223.3MB. Free memory was 174.3MB in the beginning and 172.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.48ms. Allocated memory is still 223.3MB. Free memory was 172.2MB in the beginning and 150.8MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 769186.67ms. Allocated memory was 223.3MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 149.7MB in the beginning and 444.4MB in the end (delta: -294.6MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown [2023-05-04 08:37:56,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 08:37:56,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 !SESSION 2023-05-04 08:25:02.010 ----------------------------------------------- eclipse.buildId=unknown java.version=11.0.16 java.vendor=Debian BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps "3,2 1,1 2,2" --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i Command-line arguments: -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps "3,2 1,1 2,2" --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i !ENTRY org.eclipse.osgi 4 0 2023-05-04 08:37:56.560 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0021460/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0021460/.metadata/.log.