/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 X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_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 14:24:58,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 14:24:58,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 14:24:58,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 14:24:58,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 14:24:58,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 14:24:58,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 14:24:58,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 14:24:58,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 14:24:58,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 14:24:58,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 14:24:58,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 14:24:58,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 14:24:58,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 14:24:58,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 14:24:58,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 14:24:58,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 14:24:58,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 14:24:58,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 14:24:58,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 14:24:58,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 14:24:58,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 14:24:58,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 14:24:58,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 14:24:58,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 14:24:58,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 14:24:58,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 14:24:58,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 14:24:58,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 14:24:58,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 14:24:58,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 14:24:58,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 14:24:58,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 14:24:58,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 14:24:58,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 14:24:58,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 14:24:58,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 14:24:58,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 14:24:58,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 14:24:58,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 14:24:58,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 14:24:58,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 14:24:58,872 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 14:24:58,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 14:24:58,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 14:24:58,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 14:24:58,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 14:24:58,873 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 14:24:58,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 14:24:58,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 14:24:58,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 14:24:58,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 14:24:58,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 14:24:58,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 14:24:58,876 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 14:24:58,876 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 -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 14:24:59,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 14:24:59,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 14:24:59,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 14:24:59,090 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 14:24:59,091 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 14:24:59,092 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 14:24:59,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1559f0717/966ed97635c145528ce4ae9f254003ef/FLAGf21f7e734 [2023-05-04 14:24:59,538 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 14:24:59,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-05-04 14:24:59,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1559f0717/966ed97635c145528ce4ae9f254003ef/FLAGf21f7e734 [2023-05-04 14:24:59,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1559f0717/966ed97635c145528ce4ae9f254003ef [2023-05-04 14:24:59,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 14:24:59,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 14:24:59,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 14:24:59,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 14:24:59,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 14:24:59,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 02:24:59" (1/1) ... [2023-05-04 14:24:59,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8aa5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:24:59, skipping insertion in model container [2023-05-04 14:24:59,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 02:24:59" (1/1) ... [2023-05-04 14:24:59,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 14:24:59,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 14:24:59,935 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 14:24:59,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 14:24:59,969 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 14:25:00,002 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 14:25:00,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 14:25:00,076 INFO L208 MainTranslator]: Completed translation [2023-05-04 14:25:00,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00 WrapperNode [2023-05-04 14:25:00,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 14:25:00,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 14:25:00,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 14:25:00,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 14:25:00,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,114 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 244 [2023-05-04 14:25:00,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 14:25:00,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 14:25:00,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 14:25:00,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 14:25:00,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,155 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 14:25:00,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 14:25:00,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 14:25:00,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 14:25:00,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (1/1) ... [2023-05-04 14:25:00,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 14:25:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:00,191 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 14:25:00,215 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 14:25:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 14:25:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 14:25:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 14:25:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 14:25:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 14:25:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 14:25:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 14:25:00,230 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 14:25:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 14:25:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 14:25:00,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 14:25:00,231 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 14:25:00,369 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 14:25:00,370 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 14:25:00,596 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 14:25:00,603 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 14:25:00,603 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-04 14:25:00,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 02:25:00 BoogieIcfgContainer [2023-05-04 14:25:00,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 14:25:00,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 14:25:00,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 14:25:00,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 14:25:00,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 02:24:59" (1/3) ... [2023-05-04 14:25:00,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3847242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 02:25:00, skipping insertion in model container [2023-05-04 14:25:00,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:25:00" (2/3) ... [2023-05-04 14:25:00,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3847242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 02:25:00, skipping insertion in model container [2023-05-04 14:25:00,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 02:25:00" (3/3) ... [2023-05-04 14:25:00,617 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-05-04 14:25:00,623 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 14:25:00,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 14:25:00,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 14:25:00,631 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 14:25:00,715 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 14:25:00,767 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:25:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 14:25:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:00,769 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 14:25:00,835 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 14:25:00,843 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 14:25:00,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 14:25:00,868 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;@2c5cc627, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:25:00,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 14:25:01,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1868769885, now seen corresponding path program 1 times [2023-05-04 14:25:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991245881] [2023-05-04 14:25:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 14:25:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991245881] [2023-05-04 14:25:01,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991245881] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:25:01,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:25:01,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:25:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143404491] [2023-05-04 14:25:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:25:01,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:25:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:25:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:25:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:01,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:01,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 14:25:01,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:01,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 14:25:01,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash 945582871, now seen corresponding path program 1 times [2023-05-04 14:25:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:01,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037082768] [2023-05-04 14:25:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 14:25:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037082768] [2023-05-04 14:25:01,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037082768] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029245148] [2023-05-04 14:25:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:01,754 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 14:25:01,802 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 14:25:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:01,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 14:25:01,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:25:01,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 14:25:01,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029245148] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:25:01,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 14:25:01,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 14:25:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427291321] [2023-05-04 14:25:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:25:01,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:25:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:01,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:25:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 14:25:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:01,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:01,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 14:25:01,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:01,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 14:25:02,341 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 14:25:02,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash -959394207, now seen corresponding path program 1 times [2023-05-04 14:25:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:02,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815153833] [2023-05-04 14:25:02,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 14:25:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:02,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815153833] [2023-05-04 14:25:02,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815153833] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833505328] [2023-05-04 14:25:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:02,527 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 14:25:02,551 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 14:25:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:02,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 14:25:02,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-05-04 14:25:02,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 14:25:02,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833505328] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:25:02,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 14:25:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 14:25:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432355998] [2023-05-04 14:25:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:25:02,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:25:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:25:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 14:25:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:02,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:02,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 14:25:02,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:02,743 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 14:25:02,933 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 14:25:02,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1604288933, now seen corresponding path program 1 times [2023-05-04 14:25:02,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:02,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205653934] [2023-05-04 14:25:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 14:25:03,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:03,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205653934] [2023-05-04 14:25:03,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205653934] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:03,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50586340] [2023-05-04 14:25:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:03,033 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 14:25:03,061 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 14:25:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:03,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 14:25:03,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 14:25:03,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:25:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 14:25:03,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50586340] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:25:03,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:25:03,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 14:25:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47350916] [2023-05-04 14:25:03,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:25:03,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 14:25:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 14:25:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 14:25:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:03,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:03,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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 14:25:03,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:03,329 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 14:25:03,528 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 14:25:03,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -889539333, now seen corresponding path program 2 times [2023-05-04 14:25:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:03,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630386820] [2023-05-04 14:25:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-05-04 14:25:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:03,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630386820] [2023-05-04 14:25:03,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630386820] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:03,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414764801] [2023-05-04 14:25:03,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:25:03,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:03,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:03,677 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 14:25:03,680 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 14:25:03,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:25:03,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:25:03,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 14:25:03,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 14:25:03,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:25:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 14:25:03,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414764801] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:25:03,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:25:03,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 14:25:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81693499] [2023-05-04 14:25:03,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:25:03,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 14:25:03,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:03,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 14:25:03,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 14:25:03,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:03,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:03,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.210526315789474) internal successors, (213), 19 states have internal predecessors, (213), 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 14:25:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:25:04,181 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 14:25:04,377 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 14:25:04,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1037601494, now seen corresponding path program 1 times [2023-05-04 14:25:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:04,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907108055] [2023-05-04 14:25:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:25:04,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:04,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907108055] [2023-05-04 14:25:04,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907108055] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:04,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479294225] [2023-05-04 14:25:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:04,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:04,595 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 14:25:04,622 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 14:25:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:04,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 14:25:04,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:25:04,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:25:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:25:04,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479294225] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:25:04,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:25:04,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 14:25:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944577095] [2023-05-04 14:25:04,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:25:04,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 14:25:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:04,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 14:25:04,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 14:25:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:04,941 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:04,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 14:25:04,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:04,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:04,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:04,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:04,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:25:04,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:25:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:25:05,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 14:25:05,369 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 14:25:05,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1398320027, now seen corresponding path program 2 times [2023-05-04 14:25:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:05,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367906993] [2023-05-04 14:25:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 14:25:05,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:05,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367906993] [2023-05-04 14:25:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367906993] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:05,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566482392] [2023-05-04 14:25:05,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:25:05,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:05,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:05,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:25:05,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 14:25:05,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:25:05,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:25:05,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2023-05-04 14:25:05,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:05,957 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 14:25:06,400 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-04 14:25:06,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 14:25:06,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 14:25:06,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 14:25:06,657 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 14 treesize of output 10 [2023-05-04 14:25:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 14:25:06,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:25:16,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_669) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 14:25:18,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_669) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 14:25:18,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_669) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 14:25:19,457 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 9 treesize of output 7 [2023-05-04 14:25:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2023-05-04 14:25:19,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566482392] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:25:19,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:25:19,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 30 [2023-05-04 14:25:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804844321] [2023-05-04 14:25:19,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:25:19,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-04 14:25:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:25:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-04 14:25:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=602, Unknown=7, NotChecked=156, Total=870 [2023-05-04 14:25:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:19,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:25:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 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 14:25:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:19,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:19,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:19,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:25:19,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:25:19,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:25:45,630 WARN L233 SmtUtils]: Spent 26.06s on a formula simplification. DAG size of input: 31 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:25:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:25:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:25:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:25:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:25:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-05-04 14:25:46,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 14:25:46,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:46,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:25:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:25:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2124402543, now seen corresponding path program 1 times [2023-05-04 14:25:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:25:46,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246508403] [2023-05-04 14:25:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:25:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 14:25:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:25:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246508403] [2023-05-04 14:25:49,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246508403] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:25:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445429952] [2023-05-04 14:25:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:25:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:25:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:25:49,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:25:49,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 14:25:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:25:49,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-04 14:25:49,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:25:49,587 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 14:25:49,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:25:49,871 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 14:25:49,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 14:25:50,028 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 14:25:50,337 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 14:25:50,428 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 14:26:00,919 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 14:26:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:26:00,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:26:07,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2023-05-04 14:26:08,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 14:26:10,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| 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_785)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 14:26:13,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (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_44| v_ArrVal_785)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 14:26:19,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_ArrVal_782 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_782) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_785) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2023-05-04 14:26:20,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:26:20,075 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 9 treesize of output 7 [2023-05-04 14:26:20,112 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:26:20,113 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 14:26:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 239 trivial. 28 not checked. [2023-05-04 14:26:20,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445429952] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:26:20,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:26:20,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 19] total 56 [2023-05-04 14:26:20,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381770580] [2023-05-04 14:26:20,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:26:20,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-05-04 14:26:20,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:26:20,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-05-04 14:26:20,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2280, Unknown=18, NotChecked=510, Total=3080 [2023-05-04 14:26:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:26:20,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:26:20,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.446428571428571) internal successors, (361), 56 states have internal predecessors, (361), 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 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-05-04 14:26:20,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:26:37,731 WARN L233 SmtUtils]: Spent 14.09s on a formula simplification. DAG size of input: 99 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:27:51,951 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 54 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:28:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:28:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:28:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:28:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:28:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:28:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:28:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-05-04 14:28:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 14:28:17,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 14:28:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-05-04 14:28:17,389 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:28:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:28:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1575327665, now seen corresponding path program 2 times [2023-05-04 14:28:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:28:17,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16214025] [2023-05-04 14:28:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:28:17,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:28:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:28:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 17 proven. 180 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 14:28:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:28:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16214025] [2023-05-04 14:28:21,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16214025] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:28:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931096597] [2023-05-04 14:28:21,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:28:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:28:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:28:21,728 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:28:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 14:28:21,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:28:21,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:28:21,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 14:28:21,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:28:21,913 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 14:28:22,189 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:28:22,189 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 14:28:22,231 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 14:28:22,332 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 14:28:22,634 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 14:28:22,755 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 14:28:46,287 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 14:28:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 18 proven. 152 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2023-05-04 14:28:46,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:28:52,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2023-05-04 14:28:54,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 14:28:56,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2023-05-04 14:28:58,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 (* |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_50|) 0))) is different from false [2023-05-04 14:29:00,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_935 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_935)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2023-05-04 14:29:02,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_935 Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (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_54| v_ArrVal_935)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2023-05-04 14:29:06,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_935 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_931) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) is different from false [2023-05-04 14:29:07,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:29:07,601 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 9 treesize of output 7 [2023-05-04 14:29:07,638 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:29:07,638 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 14:29:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 263 trivial. 135 not checked. [2023-05-04 14:29:07,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931096597] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:29:07,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:29:07,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 19] total 60 [2023-05-04 14:29:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842727615] [2023-05-04 14:29:07,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:29:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-05-04 14:29:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:07,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-05-04 14:29:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2475, Unknown=30, NotChecked=756, Total=3540 [2023-05-04 14:29:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:07,645 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:07,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 8.05) internal successors, (483), 60 states have internal predecessors, (483), 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 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-05-04 14:29:07,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:35,732 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 69 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:33:08,717 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse14 .cse10))) (let ((.cse15 (store .cse14 .cse1 0))) (let ((.cse4 (@diff .cse15 .cse10))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse13 (store .cse15 .cse4 0))) (let ((.cse5 (= .cse10 .cse15)) (.cse3 (= .cse10 .cse13)) (.cse0 (= .cse10 .cse14)) (.cse9 (+ .cse2 |c_~#cache~0.offset|))) (and (or .cse0 (and (<= (+ .cse1 24) .cse2) .cse3 (or (<= (+ .cse4 24) .cse2) .cse5))) (let ((.cse7 (<= (+ 28 .cse1) .cse9)) (.cse6 (<= (+ .cse4 28) .cse9))) (or (and (or .cse5 .cse6) .cse3 (or .cse0 .cse7)) (let ((.cse8 (@diff .cse13 .cse10))) (let ((.cse11 (store .cse13 .cse8 0))) (let ((.cse12 (@diff .cse11 .cse10))) (and (<= (+ .cse8 28) .cse9) (= .cse10 (store .cse11 .cse12 0)) .cse7 (or (<= (+ .cse12 28) .cse9) (= .cse10 .cse11)) .cse6)))))) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_935 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= .cse14 (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_935)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (= (select .cse14 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ .cse2 28 |c_~#cache~0.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0))) (= |c_~#cache~0.base| 3)))))))) is different from false [2023-05-04 14:33:58,227 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse11 (@diff .cse4 .cse0))) (let ((.cse1 (store .cse4 .cse11 0))) (let ((.cse10 (@diff .cse1 .cse0)) (.cse7 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse5 (<= (+ 28 .cse11) .cse7)) (.cse2 (<= (+ .cse10 28) .cse7)) (.cse3 (store .cse1 .cse10 0))) (or (and (or (= .cse0 .cse1) .cse2) (= .cse0 .cse3) (or (= .cse0 .cse4) .cse5)) (let ((.cse6 (@diff .cse3 .cse0))) (let ((.cse8 (store .cse3 .cse6 0))) (let ((.cse9 (@diff .cse8 .cse0))) (and (<= (+ .cse6 28) .cse7) (= .cse0 (store .cse8 .cse9 0)) .cse5 (or (<= (+ .cse9 28) .cse7) (= .cse0 .cse8)) .cse2)))))))))) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 0)))) is different from false [2023-05-04 14:34:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 14:34:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-05-04 14:34:00,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 14:34:00,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:34:00,605 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:34:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:34:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1389998871, now seen corresponding path program 3 times [2023-05-04 14:34:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:34:00,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039193935] [2023-05-04 14:34:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:34:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:34:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:34:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 23 proven. 390 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 14:34:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:34:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039193935] [2023-05-04 14:34:35,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039193935] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:34:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175357507] [2023-05-04 14:34:35,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 14:34:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:34:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:34:35,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:34:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 14:34:35,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-05-04 14:34:35,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:34:35,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 81 conjunts are in the unsatisfiable core [2023-05-04 14:34:36,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:34:36,188 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 14:34:36,888 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-05-04 14:34:36,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-05-04 14:34:36,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:34:37,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:34:37,543 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2023-05-04 14:34:37,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2023-05-04 14:34:37,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2023-05-04 14:34:37,859 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2023-05-04 14:34:37,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 55 [2023-05-04 14:34:37,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2023-05-04 14:34:38,468 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 14:34:38,577 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 14:35:01,633 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 14:35:04,922 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 14:36:44,651 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 20 treesize of output 16 [2023-05-04 14:36:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 35 proven. 267 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2023-05-04 14:36:44,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:36:57,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0))) is different from false [2023-05-04 14:36:59,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |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_63|) 0))) is different from false [2023-05-04 14:37:01,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0))) is different from false [2023-05-04 14:37:03,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (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_65| v_ArrVal_1155)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 14:37:05,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)))) is different from false [2023-05-04 14:37:07,236 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_46| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_46|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_46| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)))))) is different from false [2023-05-04 14:37:09,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_46| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_46| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_46| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)))) is different from false [2023-05-04 14:37:10,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_46| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_46| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_46| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (store (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_1152)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)))) is different from false [2023-05-04 14:37:12,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|v_t_funThread1of1ForFork0_~i~0#1_46| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_46| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_46| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (= (select (store (select (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_67| v_ArrVal_1152)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 28 |c_~#cache~0.offset| .cse0)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))))) is different from false [2023-05-04 14:37:19,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1152) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2023-05-04 14:37:21,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1152) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2023-05-04 14:37:23,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1152) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2023-05-04 14:37:25,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (= (select (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1152) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2023-05-04 14:37:27,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1152) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2023-05-04 14:37:39,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1144 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1144) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| v_ArrVal_1152) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2023-05-04 14:37:41,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:37:41,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:37:41,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 14:37:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 350 trivial. 229 not checked. [2023-05-04 14:37:41,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175357507] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:37:41,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:37:41,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35, 31] total 99 [2023-05-04 14:37:41,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926383078] [2023-05-04 14:37:41,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:37:41,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2023-05-04 14:37:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:37:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2023-05-04 14:37:41,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=6362, Unknown=89, NotChecked=2670, Total=9702 [2023-05-04 14:37:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:37:41,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:37:41,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 6.373737373737374) internal successors, (631), 99 states have internal predecessors, (631), 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 14:37:41,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-05-04 14:37:41,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:38:55,532 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 149 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:39:12,634 WARN L233 SmtUtils]: Spent 10.21s on a formula simplification. DAG size of input: 134 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 14:39:23,092 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 14:39:23,092 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:39:23,092 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 14:39:23,217 WARN L249 SmtUtils]: Removed 8 from assertion stack [2023-05-04 14:39:23,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 14:39:23,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-04 14:39:23,418 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 138 for 8311ms.. [2023-05-04 14:39:23,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 14:39:23,424 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2023-05-04 14:39:23,425 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-05-04 14:39:23,427 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 14:39:23,427 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 14:39:23,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 02:39:23 BasicIcfg [2023-05-04 14:39:23,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 14:39:23,429 INFO L158 Benchmark]: Toolchain (without parser) took 863852.81ms. Allocated memory was 199.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 141.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-05-04 14:39:23,429 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 14:39:23,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.51ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 141.4MB in the beginning and 228.4MB in the end (delta: -87.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2023-05-04 14:39:23,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.79ms. Allocated memory is still 274.7MB. Free memory was 228.4MB in the beginning and 225.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 14:39:23,429 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 274.7MB. Free memory was 225.3MB in the beginning and 223.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 14:39:23,429 INFO L158 Benchmark]: RCFGBuilder took 445.70ms. Allocated memory is still 274.7MB. Free memory was 222.8MB in the beginning and 202.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 14:39:23,430 INFO L158 Benchmark]: TraceAbstraction took 862821.76ms. Allocated memory was 274.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 200.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 999.1MB. Max. memory is 8.0GB. [2023-05-04 14:39:23,430 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 497.51ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 141.4MB in the beginning and 228.4MB in the end (delta: -87.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.79ms. Allocated memory is still 274.7MB. Free memory was 228.4MB in the beginning and 225.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 274.7MB. Free memory was 225.3MB in the beginning and 223.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 445.70ms. Allocated memory is still 274.7MB. Free memory was 222.8MB in the beginning and 202.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 862821.76ms. Allocated memory was 274.7MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 200.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 999.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23970, independent: 22402, independent conditional: 1245, independent unconditional: 21157, dependent: 1568, dependent conditional: 1517, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22463, independent: 22402, independent conditional: 1245, independent unconditional: 21157, dependent: 61, dependent conditional: 10, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22463, independent: 22402, independent conditional: 1245, independent unconditional: 21157, dependent: 61, dependent conditional: 10, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22471, independent: 22402, independent conditional: 0, independent unconditional: 22402, dependent: 69, dependent conditional: 8, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22471, independent: 22402, independent conditional: 0, independent unconditional: 22402, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22471, independent: 22402, independent conditional: 0, independent unconditional: 22402, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11790, independent: 11739, independent conditional: 0, independent unconditional: 11739, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11790, independent: 11720, independent conditional: 0, independent unconditional: 11720, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 218, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22471, independent: 10663, independent conditional: 0, independent unconditional: 10663, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 11790, unknown conditional: 0, unknown unconditional: 11790] , Statistics on independence cache: Total cache size (in pairs): 11790, Positive cache size: 11739, Positive conditional cache size: 0, Positive unconditional cache size: 11739, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1, Independence queries for same thread: 1507 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 387, Number of trivial persistent sets: 295, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21208, independent: 21157, independent conditional: 0, independent unconditional: 21157, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23970, independent: 22402, independent conditional: 1245, independent unconditional: 21157, dependent: 1568, dependent conditional: 1517, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22463, independent: 22402, independent conditional: 1245, independent unconditional: 21157, dependent: 61, dependent conditional: 10, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22463, independent: 22402, independent conditional: 1245, independent unconditional: 21157, dependent: 61, dependent conditional: 10, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22471, independent: 22402, independent conditional: 0, independent unconditional: 22402, dependent: 69, dependent conditional: 8, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22471, independent: 22402, independent conditional: 0, independent unconditional: 22402, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22471, independent: 22402, independent conditional: 0, independent unconditional: 22402, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11790, independent: 11739, independent conditional: 0, independent unconditional: 11739, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11790, independent: 11720, independent conditional: 0, independent unconditional: 11720, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 218, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22471, independent: 10663, independent conditional: 0, independent unconditional: 10663, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 11790, unknown conditional: 0, unknown unconditional: 11790] , Statistics on independence cache: Total cache size (in pairs): 11790, Positive cache size: 11739, Positive conditional cache size: 0, Positive unconditional cache size: 11739, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1, Independence queries for same thread: 1507 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 138 for 8311ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 266 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 862.6s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 539.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 319.7s InterpolantComputationTime, 3504 NumberOfCodeBlocks, 3418 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4823 ConstructedInterpolants, 903 QuantifiedInterpolants, 239029 SizeOfPredicates, 127 NumberOfNonLiveVariables, 3686 ConjunctsInSsa, 226 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 3716/5696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown