/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_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 08:24:54,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 08:24:54,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 08:24:54,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 08:24:54,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 08:24:54,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 08:24:54,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 08:24:54,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 08:24:54,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 08:24:54,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 08:24:54,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 08:24:54,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 08:24:54,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 08:24:54,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 08:24:54,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 08:24:54,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 08:24:54,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 08:24:54,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 08:24:54,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 08:24:54,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 08:24:54,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 08:24:54,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 08:24:54,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 08:24:54,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 08:24:54,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 08:24:54,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 08:24:54,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 08:24:54,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 08:24:54,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 08:24:54,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 08:24:54,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 08:24:54,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 08:24:54,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 08:24:54,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 08:24:54,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 08:24:54,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 08:24:54,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 08:24:54,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 08:24:54,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 08:24:54,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 08:24:54,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 08:24:54,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 08:24:54,619 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 08:24:54,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 08:24:54,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 08:24:54,620 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 08:24:54,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 08:24:54,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 08:24:54,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 08:24:54,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 08:24:54,621 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 08:24:54,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 08:24:54,622 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 08:24:54,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 08:24:54,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 08:24:54,624 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 08:24:54,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 08:24:54,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 08:24:54,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 08:24:54,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 08:24:54,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 08:24:54,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:24:54,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 08:24:54,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 08:24:54,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 08:24:54,625 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 08:24:54,625 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 08:24:54,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 08:24:54,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 08:24:54,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 08:24:54,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 08:24:54,626 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 08:24:54,626 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:24:54,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 08:24:54,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 08:24:54,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 08:24:54,905 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 08:24:54,906 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 08:24:54,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-05-04 08:24:54,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f46696fe/94cc2bebd6e54460a840ac75a715b3ba/FLAG3ee046841 [2023-05-04 08:24:55,430 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 08:24:55,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-05-04 08:24:55,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f46696fe/94cc2bebd6e54460a840ac75a715b3ba/FLAG3ee046841 [2023-05-04 08:24:55,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f46696fe/94cc2bebd6e54460a840ac75a715b3ba [2023-05-04 08:24:55,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 08:24:55,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 08:24:55,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 08:24:55,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 08:24:55,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 08:24:55,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:24:55" (1/1) ... [2023-05-04 08:24:55,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e3276a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:55, skipping insertion in model container [2023-05-04 08:24:55,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:24:55" (1/1) ... [2023-05-04 08:24:55,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 08:24:55,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 08:24:56,238 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_71-funloop_racing.i[41323,41336] [2023-05-04 08:24:56,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:24:56,297 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 08:24:56,325 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_71-funloop_racing.i[41323,41336] [2023-05-04 08:24:56,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:24:56,380 INFO L208 MainTranslator]: Completed translation [2023-05-04 08:24:56,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56 WrapperNode [2023-05-04 08:24:56,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 08:24:56,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 08:24:56,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 08:24:56,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 08:24:56,388 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:24:56" (1/1) ... [2023-05-04 08:24:56,403 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:24:56" (1/1) ... [2023-05-04 08:24:56,438 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 244 [2023-05-04 08:24:56,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 08:24:56,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 08:24:56,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 08:24:56,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 08:24:56,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 08:24:56,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 08:24:56,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 08:24:56,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 08:24:56,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (1/1) ... [2023-05-04 08:24:56,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:24:56,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:24:56,526 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:24:56,541 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:24:56,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 08:24:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 08:24:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 08:24:56,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 08:24:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 08:24:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 08:24:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 08:24:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 08:24:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 08:24:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 08:24:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 08:24:56,569 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:24:56,681 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 08:24:56,682 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 08:24:57,013 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 08:24:57,021 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 08:24:57,022 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-04 08:24:57,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:24:57 BoogieIcfgContainer [2023-05-04 08:24:57,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 08:24:57,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 08:24:57,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 08:24:57,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 08:24:57,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:24:55" (1/3) ... [2023-05-04 08:24:57,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28806c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:24:57, skipping insertion in model container [2023-05-04 08:24:57,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:24:56" (2/3) ... [2023-05-04 08:24:57,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28806c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:24:57, skipping insertion in model container [2023-05-04 08:24:57,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:24:57" (3/3) ... [2023-05-04 08:24:57,031 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-05-04 08:24:57,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 08:24:57,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 08:24:57,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 08:24:57,044 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 08:24:57,115 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 08:24:57,158 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:24:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:24:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:24:57,166 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:24:57,187 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:24:57,201 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:24:57,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 08:24:57,221 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;@3a03c3c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:24:57,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:24:58,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:24:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:24:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1485414591, now seen corresponding path program 1 times [2023-05-04 08:24:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:24:58,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129432879] [2023-05-04 08:24:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:24:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:24:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:24:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1437 trivial. 0 not checked. [2023-05-04 08:24:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:24:58,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129432879] [2023-05-04 08:24:58,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129432879] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:24:58,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:24:58,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:24:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563608076] [2023-05-04 08:24:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:24:58,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:24:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:24:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:24:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:24:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:24:58,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:24:58,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:24:58,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:24:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:24:59,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 08:24:59,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:24:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:24:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 549067113, now seen corresponding path program 1 times [2023-05-04 08:24:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:24:59,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402310126] [2023-05-04 08:24:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:24:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:24:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:24:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2141 trivial. 0 not checked. [2023-05-04 08:24:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:24:59,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402310126] [2023-05-04 08:24:59,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402310126] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:24:59,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886487133] [2023-05-04 08:24:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:24:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:24:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:24:59,705 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:24:59,748 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:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:00,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:00,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2141 trivial. 0 not checked. [2023-05-04 08:25:00,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2141 trivial. 0 not checked. [2023-05-04 08:25:00,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886487133] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:00,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:00,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:00,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319786505] [2023-05-04 08:25:00,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:00,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:00,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:00,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:00,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:00,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:00,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:00,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:00,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:00,444 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:00,637 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:00,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash -572305719, now seen corresponding path program 2 times [2023-05-04 08:25:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:00,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668706673] [2023-05-04 08:25:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2159 backedges. 319 proven. 1 refuted. 0 times theorem prover too weak. 1839 trivial. 0 not checked. [2023-05-04 08:25:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:01,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668706673] [2023-05-04 08:25:01,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668706673] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868197219] [2023-05-04 08:25:01,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:01,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:01,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:01,109 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:01,127 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:01,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:01,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:01,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:01,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2159 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2141 trivial. 0 not checked. [2023-05-04 08:25:01,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2159 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2141 trivial. 0 not checked. [2023-05-04 08:25:01,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868197219] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:01,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:01,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 08:25:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731532364] [2023-05-04 08:25:01,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:01,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 08:25:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 08:25:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 08:25:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:01,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:01,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.68421052631579) internal successors, (241), 19 states have internal predecessors, (241), 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:01,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:01,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:01,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:02,029 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:02,217 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:02,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash -149992310, now seen corresponding path program 1 times [2023-05-04 08:25:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:02,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777128221] [2023-05-04 08:25:02,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:02,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:02,610 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:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:02,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777128221] [2023-05-04 08:25:02,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777128221] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:02,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374035967] [2023-05-04 08:25:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:02,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:02,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:02,628 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:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:02,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:25:02,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:02,879 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:02,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:03,082 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:03,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374035967] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:03,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:03,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:25:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428496779] [2023-05-04 08:25:03,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:03,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:25:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:25:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:25:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:03,087 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:03,087 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:03,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:03,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:03,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:03,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:03,405 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:03,603 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:03,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1206624101, now seen corresponding path program 2 times [2023-05-04 08:25:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:03,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091014262] [2023-05-04 08:25:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:07,657 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:07,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:07,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091014262] [2023-05-04 08:25:07,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091014262] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:07,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952995409] [2023-05-04 08:25:07,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:07,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:07,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:07,662 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:07,664 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:07,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:07,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:07,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 44 conjunts are in the unsatisfiable core [2023-05-04 08:25:07,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:07,950 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:08,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:08,472 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:08,551 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:08,934 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:09,264 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:09,354 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:25:09,742 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:09,821 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:09,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:15,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-04 08:25:17,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |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_76|) 0))) is different from false [2023-05-04 08:25:19,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 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_1265)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:25:21,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 Int) (v_ArrVal_1264 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1264))) (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_1265))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:25:22,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 Int) (v_ArrVal_1264 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |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_1262)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1264))) (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_1265))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0))) is different from false [2023-05-04 08:25:22,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 Int) (v_ArrVal_1264 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |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_#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_1262)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1264))) (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| v_ArrVal_1265))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0))) is different from false [2023-05-04 08:25:24,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 Int) (v_ArrVal_1264 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (+ .cse0 |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) .cse1 v_ArrVal_1262)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1264) |c_~#cache~0.base|) .cse1 v_ArrVal_1265)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0)))) is different from false [2023-05-04 08:25:24,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 Int) (v_ArrVal_1264 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1262)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1264) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1265) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0))) is different from false [2023-05-04 08:25:24,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1265 Int) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1261))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1262))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1264) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1265) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76|) 0))) is different from false [2023-05-04 08:25:27,182 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:25:27,185 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:27,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:25:27,195 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:29,257 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:25:29,258 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:29,285 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:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952995409] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:29,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:29,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 21] total 53 [2023-05-04 08:25:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807839917] [2023-05-04 08:25:29,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:29,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-05-04 08:25:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-05-04 08:25:29,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1679, Unknown=13, NotChecked=828, Total=2756 [2023-05-04 08:25:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:29,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:29,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.283018867924528) internal successors, (280), 53 states have internal predecessors, (280), 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:29,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:29,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:29,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:29,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:29,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:41,869 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 48 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:25:56,398 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 62 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:25:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 08:25:56,660 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:25:56,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:25:56,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1857604235, now seen corresponding path program 3 times [2023-05-04 08:25:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367217692] [2023-05-04 08:25:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:56,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:16,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:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367217692] [2023-05-04 08:27:16,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367217692] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178559504] [2023-05-04 08:27:16,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:27:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:16,210 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:16,229 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:16,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-05-04 08:27:16,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:27:16,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 60 conjunts are in the unsatisfiable core [2023-05-04 08:27:16,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:16,699 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:17,120 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:27:17,121 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:17,224 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:17,543 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:17,721 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:27:24,534 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:27,392 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 24 treesize of output 19 [2023-05-04 08:28:06,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-05-04 08:28:10,739 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 24 treesize of output 19 [2023-05-04 08:28:19,161 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 27 treesize of output 22 [2023-05-04 08:29:19,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-05-04 08:29:20,195 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:29:20,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:29:24,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-04 08:29:26,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:29:28,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1439 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_1439)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:29:28,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1435 (Array Int Int)) (v_ArrVal_1439 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435))) (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_1439))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:29:28,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1439 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435))) (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_86| v_ArrVal_1439))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 08:29:28,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1439 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|)))) is different from false [2023-05-04 08:29:28,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_54| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_54|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1439 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0)))))) is different from false [2023-05-04 08:29:29,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1439 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0)))) is different from false [2023-05-04 08:29:31,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (v_ArrVal_1439 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select (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_1433)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-05-04 08:29:34,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (v_ArrVal_1439 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (or (= (select (store (select (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_88| v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse0 28 |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-05-04 08:29:34,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (v_ArrVal_1439 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (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_88| v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0)))) is different from false [2023-05-04 08:29:34,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (v_ArrVal_1439 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (= (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_88| v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0))))) is different from false [2023-05-04 08:29:34,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (v_ArrVal_1439 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_88| v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0))))) is different from false [2023-05-04 08:29:34,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1429 Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (v_ArrVal_1439 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse1 28 |c_~#cache~0.offset|)) (= (select (store (select (store (let ((.cse2 (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_1429)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| v_ArrVal_1433))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2023-05-04 08:29:34,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1429 Int) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int) (v_ArrVal_1439 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (store (select (store (let ((.cse2 (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_90| v_ArrVal_1429)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| v_ArrVal_1433))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0))))) is different from false [2023-05-04 08:29:34,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1429 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int) (v_ArrVal_1439 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_1429) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| v_ArrVal_1433)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0))) is different from false [2023-05-04 08:29:34,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int) (v_ArrVal_1429 Int) (v_ArrVal_1426 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| Int) (v_ArrVal_1435 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| Int) (v_ArrVal_1433 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int) (v_ArrVal_1439 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 84)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1426))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_1429) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88| v_ArrVal_1433))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1435) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| v_ArrVal_1439) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_88|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_86| 28)))) is different from false [2023-05-04 08:29:36,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:29:36,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:29:36,357 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:29:36,360 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 27 treesize of output 25 [2023-05-04 08:29:36,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:29:36,365 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 58 treesize of output 54 [2023-05-04 08:29:36,461 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:29:36,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:29:36,465 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:29:36,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178559504] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:29:36,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:29:36,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 28] total 82 [2023-05-04 08:29:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259535141] [2023-05-04 08:29:36,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:29:36,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-05-04 08:29:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:29:36,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-05-04 08:29:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3791, Unknown=80, NotChecked=2414, Total=6642 [2023-05-04 08:29:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:29:36,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:29:36,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 6.036585365853658) internal successors, (495), 82 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:29:36,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:29:36,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:29:36,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:29:36,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:29:36,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 08:29:36,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:34:53,114 WARN L233 SmtUtils]: Spent 30.55s on a formula simplification. DAG size of input: 155 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:35:50,952 WARN L233 SmtUtils]: Spent 41.43s on a formula simplification. DAG size of input: 152 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:46,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 08:37:27,727 WARN L233 SmtUtils]: Spent 34.32s on a formula simplification. DAG size of input: 103 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:37:30,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 08:37:31,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 08:37:37,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 08:37:47,059 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse21 (@diff .cse6 .cse0))) (let ((.cse10 (store .cse6 .cse21 0))) (let ((.cse22 (@diff .cse10 .cse0))) (let ((.cse13 (store .cse10 .cse22 0))) (let ((.cse20 (@diff .cse13 .cse0))) (let ((.cse3 (store .cse13 .cse20 0))) (let ((.cse18 (@diff .cse3 .cse0))) (let ((.cse1 (store .cse3 .cse18 0))) (let ((.cse19 (@diff .cse1 .cse0))) (let ((.cse8 (store .cse1 .cse19 0))) (let ((.cse17 (@diff .cse8 .cse0))) (let ((.cse9 (<= (+ .cse22 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (.cse7 (<= (+ .cse17 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (.cse5 (<= (+ .cse21 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (.cse12 (<= (+ .cse20 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (.cse2 (<= (+ .cse19 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (.cse4 (<= (+ .cse18 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (.cse11 (store .cse8 .cse17 0))) (or (and (or (= .cse0 .cse1) .cse2) (or (= .cse3 .cse0) .cse4) (or .cse5 (= .cse0 .cse6)) (or .cse7 (= .cse0 .cse8)) (or .cse9 (= .cse0 .cse10)) (= .cse0 .cse11) (or .cse12 (= .cse13 .cse0))) (let ((.cse14 (@diff .cse11 .cse0))) (let ((.cse15 (store .cse11 .cse14 0))) (let ((.cse16 (@diff .cse15 .cse0))) (and .cse9 .cse7 .cse5 (<= (+ .cse14 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse12 .cse2 .cse4 (or (= .cse0 .cse15) (<= (+ .cse16 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (store .cse15 .cse16 0) .cse0))))))))))))))))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_84|) 0))) (= |c_~#cache~0.offset| 0)) is different from false [2023-05-04 08:37:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:37:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:37:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:37:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:37:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 08:37:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-05-04 08:37:47,094 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:37:47,289 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:37:47,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:37:47,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:37:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash 856035246, now seen corresponding path program 4 times [2023-05-04 08:37:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:37:47,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135940571] [2023-05-04 08:37:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:37:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:37:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-05-04 08:38:58,989 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:38:58,989 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:38:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 08:38:59,272 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:38:59,278 INFO L158 Benchmark]: Toolchain (without parser) took 843510.99ms. Allocated memory was 223.3MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 189.6MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-05-04 08:38:59,280 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 08:38:59,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.89ms. Allocated memory is still 223.3MB. Free memory was 189.2MB in the beginning and 171.6MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-05-04 08:38:59,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.97ms. Allocated memory is still 223.3MB. Free memory was 171.6MB in the beginning and 168.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 08:38:59,281 INFO L158 Benchmark]: Boogie Preprocessor took 48.48ms. Allocated memory is still 223.3MB. Free memory was 168.4MB in the beginning and 166.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 08:38:59,281 INFO L158 Benchmark]: RCFGBuilder took 534.93ms. Allocated memory is still 223.3MB. Free memory was 166.3MB in the beginning and 145.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 08:38:59,281 INFO L158 Benchmark]: TraceAbstraction took 842251.59ms. Allocated memory was 223.3MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 144.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-05-04 08:38:59,282 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.12ms. Allocated memory is still 181.4MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 612.89ms. Allocated memory is still 223.3MB. Free memory was 189.2MB in the beginning and 171.6MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.97ms. Allocated memory is still 223.3MB. Free memory was 171.6MB in the beginning and 168.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.48ms. Allocated memory is still 223.3MB. Free memory was 168.4MB in the beginning and 166.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 534.93ms. Allocated memory is still 223.3MB. Free memory was 166.3MB in the beginning and 145.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 842251.59ms. Allocated memory was 223.3MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 144.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.0GB. 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