/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 LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 20:08:21,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 20:08:21,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 20:08:21,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 20:08:21,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 20:08:21,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 20:08:21,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 20:08:21,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 20:08:21,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 20:08:21,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 20:08:21,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 20:08:21,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 20:08:21,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 20:08:21,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 20:08:21,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 20:08:21,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 20:08:21,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 20:08:21,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 20:08:21,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 20:08:21,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 20:08:21,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 20:08:21,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 20:08:21,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 20:08:21,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 20:08:21,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 20:08:21,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 20:08:21,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 20:08:21,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 20:08:21,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 20:08:21,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 20:08:21,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 20:08:21,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 20:08:21,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 20:08:21,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 20:08:21,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 20:08:21,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 20:08:21,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 20:08:21,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 20:08:21,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 20:08:21,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 20:08:21,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 20:08:21,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 20:08:21,125 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 20:08:21,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 20:08:21,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 20:08:21,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 20:08:21,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 20:08:21,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 20:08:21,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 20:08:21,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 20:08:21,127 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 20:08:21,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 20:08:21,127 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 20:08:21,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 20:08:21,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 20:08:21,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:08:21,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 20:08:21,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 20:08:21,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 20:08:21,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 20:08:21,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 20:08:21,130 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 20:08:21,130 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 -> LOOP [2023-05-04 20:08:21,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 20:08:21,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 20:08:21,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 20:08:21,359 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 20:08:21,367 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 20:08:21,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-05-04 20:08:21,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1181223e/0ecc82da3d2642e18651c8cb34b4c65c/FLAG6bb032f60 [2023-05-04 20:08:21,853 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 20:08:21,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-05-04 20:08:21,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1181223e/0ecc82da3d2642e18651c8cb34b4c65c/FLAG6bb032f60 [2023-05-04 20:08:21,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1181223e/0ecc82da3d2642e18651c8cb34b4c65c [2023-05-04 20:08:21,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 20:08:21,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 20:08:21,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 20:08:21,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 20:08:21,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 20:08:21,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:08:21" (1/1) ... [2023-05-04 20:08:21,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7476cf67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:21, skipping insertion in model container [2023-05-04 20:08:21,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:08:21" (1/1) ... [2023-05-04 20:08:21,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 20:08:21,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 20:08:22,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2023-05-04 20:08:22,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:08:22,341 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 20:08:22,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2023-05-04 20:08:22,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:08:22,424 INFO L208 MainTranslator]: Completed translation [2023-05-04 20:08:22,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22 WrapperNode [2023-05-04 20:08:22,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 20:08:22,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 20:08:22,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 20:08:22,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 20:08:22,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,473 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2023-05-04 20:08:22,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 20:08:22,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 20:08:22,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 20:08:22,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 20:08:22,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 20:08:22,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 20:08:22,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 20:08:22,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 20:08:22,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (1/1) ... [2023-05-04 20:08:22,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:08:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:22,554 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 20:08:22,565 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 20:08:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 20:08:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 20:08:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 20:08:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 20:08:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 20:08:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 20:08:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 20:08:22,602 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 20:08:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 20:08:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 20:08:22,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 20:08:22,603 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 20:08:22,768 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 20:08:22,769 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 20:08:23,060 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 20:08:23,067 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 20:08:23,067 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-04 20:08:23,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:08:23 BoogieIcfgContainer [2023-05-04 20:08:23,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 20:08:23,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 20:08:23,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 20:08:23,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 20:08:23,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:08:21" (1/3) ... [2023-05-04 20:08:23,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e5cc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:08:23, skipping insertion in model container [2023-05-04 20:08:23,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:08:22" (2/3) ... [2023-05-04 20:08:23,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e5cc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:08:23, skipping insertion in model container [2023-05-04 20:08:23,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:08:23" (3/3) ... [2023-05-04 20:08:23,093 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-05-04 20:08:23,100 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 20:08:23,106 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 20:08:23,106 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 20:08:23,106 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 20:08:23,171 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 20:08:23,244 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:08:23,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 20:08:23,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:23,253 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 20:08:23,261 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 20:08:23,290 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 20:08:23,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 20:08:23,309 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;@5ba57cf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:08:23,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 20:08:23,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1548190902, now seen corresponding path program 1 times [2023-05-04 20:08:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:23,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739255168] [2023-05-04 20:08:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-04 20:08:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:24,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739255168] [2023-05-04 20:08:24,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739255168] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:08:24,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:08:24,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 20:08:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908970896] [2023-05-04 20:08:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:08:24,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 20:08:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:24,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 20:08:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 20:08:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:24,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:24,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:08:24,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:24,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 20:08:24,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1399768447, now seen corresponding path program 1 times [2023-05-04 20:08:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:24,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822062829] [2023-05-04 20:08:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-05-04 20:08:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:24,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822062829] [2023-05-04 20:08:24,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822062829] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:24,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142089555] [2023-05-04 20:08:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:24,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:24,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:24,337 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 20:08:24,353 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 20:08:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:24,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 20:08:24,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-05-04 20:08:24,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 20:08:24,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142089555] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:08:24,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 20:08:24,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 20:08:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32922441] [2023-05-04 20:08:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:08:24,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 20:08:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:24,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 20:08:24,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 20:08:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:24,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 20:08:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:24,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 20:08:24,861 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 20:08:24,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash -275475340, now seen corresponding path program 1 times [2023-05-04 20:08:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:24,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500244010] [2023-05-04 20:08:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 20:08:25,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500244010] [2023-05-04 20:08:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500244010] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:25,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42057560] [2023-05-04 20:08:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:25,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:25,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:25,093 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 20:08:25,113 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 20:08:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:25,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 20:08:25,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-05-04 20:08:25,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 20:08:25,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42057560] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:08:25,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 20:08:25,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 20:08:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805304640] [2023-05-04 20:08:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:08:25,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 20:08:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 20:08:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 20:08:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:25,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:25,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 20:08:25,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,361 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 20:08:25,550 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 20:08:25,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -516327819, now seen corresponding path program 1 times [2023-05-04 20:08:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:25,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923039173] [2023-05-04 20:08:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 20:08:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923039173] [2023-05-04 20:08:25,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923039173] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:25,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56283748] [2023-05-04 20:08:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:25,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:25,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:25,671 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 20:08:25,694 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 20:08:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:25,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 20:08:25,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 20:08:25,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:08:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 20:08:25,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56283748] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:08:25,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:08:25,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 20:08:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950404669] [2023-05-04 20:08:25,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:08:25,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 20:08:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 20:08:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 20:08:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:25,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:25,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 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 20:08:25,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:25,980 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 20:08:26,177 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 20:08:26,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1817736341, now seen corresponding path program 2 times [2023-05-04 20:08:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:26,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341412077] [2023-05-04 20:08:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-05-04 20:08:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:26,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341412077] [2023-05-04 20:08:26,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341412077] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:26,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173834076] [2023-05-04 20:08:26,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:08:26,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:26,342 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 20:08:26,370 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 20:08:26,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:08:26,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:08:26,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 20:08:26,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 20:08:26,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:08:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 20:08:26,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173834076] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:08:26,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:08:26,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 20:08:26,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334144613] [2023-05-04 20:08:26,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:08:26,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 20:08:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 20:08:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 20:08:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:26,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:26,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.526315789473685) internal successors, (219), 19 states have internal predecessors, (219), 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 20:08:26,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:26,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:26,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:26,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:26,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:08:26,935 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 20:08:27,135 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 20:08:27,135 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -690061599, now seen corresponding path program 1 times [2023-05-04 20:08:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603708402] [2023-05-04 20:08:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:27,338 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 20:08:27,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:27,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603708402] [2023-05-04 20:08:27,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603708402] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326410374] [2023-05-04 20:08:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:27,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:27,340 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 20:08:27,365 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 20:08:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:27,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 20:08:27,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:27,505 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 20:08:27,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:08:27,689 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 20:08:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326410374] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:08:27,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:08:27,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 20:08:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845315888] [2023-05-04 20:08:27,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:08:27,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 20:08:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 20:08:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 20:08:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:27,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:27,692 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 20:08:27,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:27,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:27,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:27,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:27,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:08:27,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:08:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:08:27,982 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 20:08:28,168 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 20:08:28,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash 619162302, now seen corresponding path program 2 times [2023-05-04 20:08:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:28,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118502922] [2023-05-04 20:08:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:28,534 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 20:08:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118502922] [2023-05-04 20:08:28,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118502922] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357085580] [2023-05-04 20:08:28,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:08:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:28,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:28,536 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 20:08:28,564 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 20:08:28,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:08:28,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:08:28,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-04 20:08:28,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:28,678 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 20:08:28,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:08:28,936 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 20:08:28,974 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 20:08:29,087 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 20:08:29,116 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 20:08:29,159 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 20:08:29,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:08:37,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_829 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_829) |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 20:08:39,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_829 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_829) |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 20:08:41,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_829 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_829) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 20:08:41,637 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 20:08:41,658 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:08:41,659 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 20:08:41,662 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 20:08:41,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357085580] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:08:41,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:08:41,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-05-04 20:08:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950851487] [2023-05-04 20:08:41,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:08:41,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 20:08:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:08:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 20:08:41,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=361, Unknown=6, NotChecked=120, Total=552 [2023-05-04 20:08:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:41,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:08:41,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 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 20:08:41,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:41,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:41,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:41,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:41,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:08:41,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:08:41,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:08:47,742 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:08:53,810 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 23 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:08:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:08:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:08:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:08:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:08:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:08:53,973 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 20:08:54,149 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 20:08:54,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:08:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:08:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2118492515, now seen corresponding path program 1 times [2023-05-04 20:08:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:08:54,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503240470] [2023-05-04 20:08:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:08:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:08:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:08:55,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503240470] [2023-05-04 20:08:55,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503240470] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:08:55,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081773314] [2023-05-04 20:08:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:08:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:08:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:08:55,612 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 20:08:55,618 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 20:08:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:08:55,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-04 20:08:55,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:08:55,770 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 20:08:56,037 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:08:56,038 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 20:08:56,081 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 20:08:56,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20:08:56,398 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 20:08:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2023-05-04 20:08:56,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:09:00,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (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_910) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 20:09:00,931 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 20:09:00,956 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:09:00,956 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 20:09:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 239 trivial. 8 not checked. [2023-05-04 20:09:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081773314] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:09:00,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:09:00,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 40 [2023-05-04 20:09:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442750159] [2023-05-04 20:09:00,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:09:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 20:09:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:09:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 20:09:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1320, Unknown=3, NotChecked=74, Total=1560 [2023-05-04 20:09:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:09:00,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:09:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 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 20:09:00,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:00,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:09:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:09:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:09:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:09:00,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:09:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:09:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:09:02,259 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 20:09:02,450 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 20:09:02,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:09:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:09:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1151407817, now seen corresponding path program 1 times [2023-05-04 20:09:02,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:09:02,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477311409] [2023-05-04 20:09:02,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:09:02,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:09:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:09:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 10 proven. 98 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:09:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:09:05,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477311409] [2023-05-04 20:09:05,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477311409] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:09:05,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597630326] [2023-05-04 20:09:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:09:05,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:09:05,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:09:05,513 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 20:09:05,514 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 20:09:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:09:05,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-04 20:09:05,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:09:05,723 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 20:09:05,971 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:09:05,972 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 20:09:06,011 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 20:09:06,105 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 20:09:06,433 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 20:09:06,535 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 20:09:16,810 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 20:09:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-05-04 20:09:16,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:09:23,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ 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_51|) 0))) is different from false [2023-05-04 20:09:24,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ (* |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_51|) 0))) is different from false [2023-05-04 20:09:27,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1043 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ (* |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_1043)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0))) is different from false [2023-05-04 20:09:29,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1043 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 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_53| v_ArrVal_1043)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2023-05-04 20:09:33,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1043 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1039) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1043) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28)))) is different from false [2023-05-04 20:09:34,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:09:34,073 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 20:09:34,107 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:09:34,108 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 20:09:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 260 trivial. 46 not checked. [2023-05-04 20:09:34,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597630326] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:09:34,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:09:34,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 19] total 58 [2023-05-04 20:09:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219371787] [2023-05-04 20:09:34,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:09:34,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-04 20:09:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:09:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-04 20:09:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2465, Unknown=17, NotChecked=530, Total=3306 [2023-05-04 20:09:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:09:34,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:09:34,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.0) internal successors, (406), 58 states have internal predecessors, (406), 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 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:09:34,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:10:13,830 WARN L233 SmtUtils]: Spent 10.87s on a formula simplification. DAG size of input: 80 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:10:28,569 WARN L233 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 118 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:10:42,111 WARN L233 SmtUtils]: Spent 13.41s on a formula simplification. DAG size of input: 109 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:10:54,379 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 87 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:11:05,952 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 98 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:13:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:13:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-05-04 20:13:42,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-05-04 20:13:42,455 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 20:13:42,481 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:13:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:13:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1050622548, now seen corresponding path program 2 times [2023-05-04 20:13:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:13:42,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456802232] [2023-05-04 20:13:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:13:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:13:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:13:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 30 proven. 389 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:13:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:13:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456802232] [2023-05-04 20:13:58,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456802232] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:13:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622929904] [2023-05-04 20:13:58,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:13:58,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:13:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:13:58,504 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 20:13:58,505 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 20:13:58,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:13:58,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:13:58,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-04 20:13:58,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:13:58,804 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 20:13:59,144 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:13:59,145 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 20:13:59,199 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 20:13:59,357 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 20:13:59,867 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 20:13:59,973 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 20:14:43,958 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 20:14:47,005 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 20:17:13,410 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 20:17:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 36 proven. 370 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-05-04 20:17:13,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:17:19,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 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_62|) 0))) is different from false [2023-05-04 20:17:21,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:17:23,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-04 20:17:25,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:17:27,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1244 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 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_1244)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-05-04 20:17:29,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 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_66| v_ArrVal_1244)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2023-05-04 20:17:31,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 20:18:24,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 20:18:26,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 20:18:28,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 20:18:29,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int) (v_ArrVal_1239 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (= (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_1239)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 20:18:31,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1244 Int) (v_ArrVal_1239 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_70| v_ArrVal_1239)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 20:18:39,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1244 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1239 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1236) |c_~#cache~0.base|))) (or (= (select (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_1239) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1244) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (not (= (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|))))) is different from false [2023-05-04 20:18:40,379 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:18:40,379 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:18:40,386 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:18:40,386 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 33 treesize of output 32 [2023-05-04 20:18:40,444 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:18:40,445 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 20:18:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 248 trivial. 351 not checked. [2023-05-04 20:18:40,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622929904] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:18:40,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:18:40,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 32] total 94 [2023-05-04 20:18:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950239837] [2023-05-04 20:18:40,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:18:40,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-05-04 20:18:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:18:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-05-04 20:18:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=5785, Unknown=175, NotChecked=2210, Total=8742 [2023-05-04 20:18:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:18:40,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:18:40,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 7.468085106382978) internal successors, (702), 94 states have internal predecessors, (702), 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 20:18:40,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:18:40,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2023-05-04 20:18:40,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:21:01,580 WARN L233 SmtUtils]: Spent 14.33s on a formula simplification. DAG size of input: 136 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:21:28,867 WARN L233 SmtUtils]: Spent 15.02s on a formula simplification. DAG size of input: 132 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:21:47,142 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 124 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 20:22:53,609 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 20:22:53,625 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 20:22:53,656 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 20:22:53,919 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 20:22:54,104 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 20:22:54,104 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. [2023-05-04 20:22:54,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 20:22:54,109 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2023-05-04 20:22:54,110 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-05-04 20:22:54,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 20:22:54,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 20:22:54,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 08:22:54 BasicIcfg [2023-05-04 20:22:54,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 20:22:54,113 INFO L158 Benchmark]: Toolchain (without parser) took 872228.83ms. Allocated memory was 194.0MB in the beginning and 623.9MB in the end (delta: 429.9MB). Free memory was 162.7MB in the beginning and 471.4MB in the end (delta: -308.7MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2023-05-04 20:22:54,113 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 20:22:54,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.73ms. Allocated memory is still 194.0MB. Free memory was 162.4MB in the beginning and 151.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2023-05-04 20:22:54,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 194.0MB. Free memory was 151.5MB in the beginning and 149.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 20:22:54,113 INFO L158 Benchmark]: Boogie Preprocessor took 35.98ms. Allocated memory is still 194.0MB. Free memory was 148.5MB in the beginning and 146.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 20:22:54,114 INFO L158 Benchmark]: RCFGBuilder took 559.45ms. Allocated memory is still 194.0MB. Free memory was 146.4MB in the beginning and 125.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 20:22:54,114 INFO L158 Benchmark]: TraceAbstraction took 871040.11ms. Allocated memory was 194.0MB in the beginning and 623.9MB in the end (delta: 429.9MB). Free memory was 124.4MB in the beginning and 471.4MB in the end (delta: -347.0MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. [2023-05-04 20:22:54,115 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 127.9MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 538.73ms. Allocated memory is still 194.0MB. Free memory was 162.4MB in the beginning and 151.5MB in the end (delta: 10.9MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 194.0MB. Free memory was 151.5MB in the beginning and 149.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.98ms. Allocated memory is still 194.0MB. Free memory was 148.5MB in the beginning and 146.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.45ms. Allocated memory is still 194.0MB. Free memory was 146.4MB in the beginning and 125.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 871040.11ms. Allocated memory was 194.0MB in the beginning and 623.9MB in the end (delta: 429.9MB). Free memory was 124.4MB in the beginning and 471.4MB in the end (delta: -347.0MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21074, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 1841, dependent conditional: 1794, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19295, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 62, dependent conditional: 15, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19295, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 62, dependent conditional: 15, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19309, independent: 19233, independent conditional: 0, independent unconditional: 19233, dependent: 76, dependent conditional: 14, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19309, independent: 19233, independent conditional: 0, independent unconditional: 19233, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19309, independent: 19233, independent conditional: 0, independent unconditional: 19233, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12175, independent: 12128, independent conditional: 0, independent unconditional: 12128, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12175, independent: 12099, independent conditional: 0, independent unconditional: 12099, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 76, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19309, independent: 7105, independent conditional: 0, independent unconditional: 7105, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 12175, unknown conditional: 0, unknown unconditional: 12175] , Statistics on independence cache: Total cache size (in pairs): 12175, Positive cache size: 12128, Positive conditional cache size: 0, Positive unconditional cache size: 12128, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1, Independence queries for same thread: 1779 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 431, Number of trivial persistent sets: 336, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17174, independent: 17127, independent conditional: 0, independent unconditional: 17127, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21074, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 1841, dependent conditional: 1794, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19295, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 62, dependent conditional: 15, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19295, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 62, dependent conditional: 15, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19309, independent: 19233, independent conditional: 0, independent unconditional: 19233, dependent: 76, dependent conditional: 14, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19309, independent: 19233, independent conditional: 0, independent unconditional: 19233, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19309, independent: 19233, independent conditional: 0, independent unconditional: 19233, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12175, independent: 12128, independent conditional: 0, independent unconditional: 12128, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12175, independent: 12099, independent conditional: 0, independent unconditional: 12099, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 76, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19309, independent: 7105, independent conditional: 0, independent unconditional: 7105, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 12175, unknown conditional: 0, unknown unconditional: 12175] , Statistics on independence cache: Total cache size (in pairs): 12175, Positive cache size: 12128, Positive conditional cache size: 0, Positive unconditional cache size: 12128, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 1, Independence queries for same thread: 1779 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 269 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 870.9s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 516.2s, 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: 200, 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.6s SatisfiabilityAnalysisTime, 350.8s InterpolantComputationTime, 3678 NumberOfCodeBlocks, 3678 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5003 ConstructedInterpolants, 836 QuantifiedInterpolants, 151728 SizeOfPredicates, 115 NumberOfNonLiveVariables, 4090 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 4306/6167 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