/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 11:24:29,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 11:24:29,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 11:24:29,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 11:24:29,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 11:24:29,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 11:24:29,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 11:24:29,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 11:24:29,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 11:24:29,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 11:24:29,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 11:24:29,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 11:24:29,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 11:24:29,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 11:24:29,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 11:24:29,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 11:24:29,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 11:24:29,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 11:24:29,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 11:24:29,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 11:24:29,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 11:24:29,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 11:24:29,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 11:24:29,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 11:24:29,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 11:24:29,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 11:24:29,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 11:24:29,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 11:24:29,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 11:24:29,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 11:24:29,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 11:24:29,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 11:24:29,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 11:24:29,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 11:24:29,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 11:24:29,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 11:24:29,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 11:24:29,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 11:24:29,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 11:24:29,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 11:24:29,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 11:24:29,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 11:24:29,693 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 11:24:29,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 11:24:29,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 11:24:29,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 11:24:29,694 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 11:24:29,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 11:24:29,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 11:24:29,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 11:24:29,695 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 11:24:29,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 11:24:29,695 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 11:24:29,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 11:24:29,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 11:24:29,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 11:24:29,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 11:24:29,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 11:24:29,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:24:29,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 11:24:29,698 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 11:24:29,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 11:24:29,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 11:24:29,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 11:24:29,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 11:24:29,901 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 11:24:29,903 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 11:24:29,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-05-04 11:24:29,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c790727/63f1817c2b3f411c94ef23dd3fa1d1d2/FLAG2ce0758c3 [2023-05-04 11:24:30,385 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 11:24:30,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-05-04 11:24:30,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c790727/63f1817c2b3f411c94ef23dd3fa1d1d2/FLAG2ce0758c3 [2023-05-04 11:24:30,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c790727/63f1817c2b3f411c94ef23dd3fa1d1d2 [2023-05-04 11:24:30,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 11:24:30,422 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 11:24:30,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 11:24:30,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 11:24:30,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 11:24:30,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a31aba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30, skipping insertion in model container [2023-05-04 11:24:30,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 11:24:30,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 11:24:30,821 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_72-funloop_hard_racing.i[41323,41336] [2023-05-04 11:24:30,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:24:30,857 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 11:24:30,886 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_72-funloop_hard_racing.i[41323,41336] [2023-05-04 11:24:30,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:24:30,931 INFO L208 MainTranslator]: Completed translation [2023-05-04 11:24:30,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30 WrapperNode [2023-05-04 11:24:30,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 11:24:30,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 11:24:30,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 11:24:30,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 11:24:30,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,982 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2023-05-04 11:24:30,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 11:24:30,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 11:24:30,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 11:24:30,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 11:24:30,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:30,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:31,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:31,017 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:31,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:31,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 11:24:31,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 11:24:31,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 11:24:31,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 11:24:31,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (1/1) ... [2023-05-04 11:24:31,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:24:31,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:31,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 11:24:31,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 11:24:31,094 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 11:24:31,095 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 11:24:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 11:24:31,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 11:24:31,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 11:24:31,096 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 11:24:31,194 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 11:24:31,195 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 11:24:31,534 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 11:24:31,540 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 11:24:31,541 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-04 11:24:31,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:24:31 BoogieIcfgContainer [2023-05-04 11:24:31,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 11:24:31,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 11:24:31,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 11:24:31,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 11:24:31,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 11:24:30" (1/3) ... [2023-05-04 11:24:31,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729b6548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:24:31, skipping insertion in model container [2023-05-04 11:24:31,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:24:30" (2/3) ... [2023-05-04 11:24:31,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729b6548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:24:31, skipping insertion in model container [2023-05-04 11:24:31,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:24:31" (3/3) ... [2023-05-04 11:24:31,555 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-05-04 11:24:31,561 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 11:24:31,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 11:24:31,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 11:24:31,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 11:24:31,616 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 11:24:31,660 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:24:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 11:24:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:31,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 11:24:31,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 11:24:31,684 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 11:24:31,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 11:24:31,699 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;@796fd51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:24:31,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 11:24:31,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1548190902, now seen corresponding path program 1 times [2023-05-04 11:24:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:31,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279150728] [2023-05-04 11:24:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:32,306 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 11:24:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:32,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279150728] [2023-05-04 11:24:32,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279150728] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:24:32,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:24:32,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 11:24:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960970789] [2023-05-04 11:24:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:24:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:24:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:24:32,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 11:24:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:32,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:32,329 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 11:24:32,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:32,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 11:24:32,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1399768447, now seen corresponding path program 1 times [2023-05-04 11:24:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:32,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098774196] [2023-05-04 11:24:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:32,673 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 11:24:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098774196] [2023-05-04 11:24:32,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098774196] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:24:32,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537577630] [2023-05-04 11:24:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:32,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:24:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:32,677 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 11:24:32,728 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 11:24:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:32,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 11:24:32,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:24:32,894 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 11:24:32,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 11:24:32,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537577630] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:24:32,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 11:24:32,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 11:24:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430438433] [2023-05-04 11:24:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:24:32,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:24:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:24:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:24:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:32,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:32,898 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 11:24:32,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:32,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 11:24:33,237 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 11:24:33,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -275475340, now seen corresponding path program 1 times [2023-05-04 11:24:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622331472] [2023-05-04 11:24:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:33,435 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 11:24:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:33,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622331472] [2023-05-04 11:24:33,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622331472] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:24:33,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215678446] [2023-05-04 11:24:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:33,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:24:33,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:33,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:24:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 11:24:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:33,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 11:24:33,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:24:33,623 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 11:24:33,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 11:24:33,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215678446] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:24:33,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 11:24:33,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 11:24:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915685938] [2023-05-04 11:24:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:24:33,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:24:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:24:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:24:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:33,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:33,626 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 11:24:33,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:33,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 11:24:33,879 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 11:24:33,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -516327819, now seen corresponding path program 1 times [2023-05-04 11:24:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:33,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628269597] [2023-05-04 11:24:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:34,013 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 11:24:34,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:34,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628269597] [2023-05-04 11:24:34,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628269597] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:24:34,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954466217] [2023-05-04 11:24:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:34,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:24:34,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:34,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:24:34,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 11:24:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:34,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 11:24:34,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:24:34,210 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 11:24:34,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:24:34,243 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 11:24:34,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954466217] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:24:34,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:24:34,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 11:24:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443827274] [2023-05-04 11:24:34,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:24:34,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 11:24:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:34,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 11:24:34,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 11:24:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:34,246 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:34,246 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 11:24:34,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:34,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:34,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:34,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:24:34,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 11:24:34,532 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 11:24:34,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1817736341, now seen corresponding path program 2 times [2023-05-04 11:24:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:34,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261340907] [2023-05-04 11:24:34,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:34,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:34,708 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 11:24:34,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261340907] [2023-05-04 11:24:34,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261340907] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:24:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103177340] [2023-05-04 11:24:34,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:24:34,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:24:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:34,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:24:34,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 11:24:34,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:24:34,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:24:34,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 11:24:34,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:24:34,924 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 11:24:34,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:24:34,999 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 11:24:34,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103177340] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:24:34,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:24:34,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 11:24:34,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482831622] [2023-05-04 11:24:34,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:24:35,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 11:24:35,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 11:24:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 11:24:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:35,001 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:35,001 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 11:24:35,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:24:35,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:24:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:24:35,220 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 11:24:35,417 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 11:24:35,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:35,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash -690061599, now seen corresponding path program 1 times [2023-05-04 11:24:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:35,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082332422] [2023-05-04 11:24:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:35,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:35,668 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 11:24:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082332422] [2023-05-04 11:24:35,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082332422] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:24:35,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978909181] [2023-05-04 11:24:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:35,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:24:35,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:35,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:24:35,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 11:24:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:35,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 11:24:35,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:24:35,828 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 11:24:35,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:24:35,970 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 11:24:35,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978909181] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:24:35,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:24:35,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 11:24:35,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680951160] [2023-05-04 11:24:35,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:24:35,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 11:24:35,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:35,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 11:24:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 11:24:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:35,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:35,972 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 11:24:35,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:24:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:24:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:24:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:24:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:24:36,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 11:24:36,429 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 11:24:36,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:24:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:24:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash 619162302, now seen corresponding path program 2 times [2023-05-04 11:24:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:24:36,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47153940] [2023-05-04 11:24:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:24:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:24:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:24:36,724 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 11:24:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:24:36,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47153940] [2023-05-04 11:24:36,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47153940] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:24:36,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890267249] [2023-05-04 11:24:36,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:24:36,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:24:36,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:24:36,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:24:36,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 11:24:36,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:24:36,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:24:36,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-04 11:24:36,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:24:36,881 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 11:24:37,105 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:24:37,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:24:37,137 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 11:24:37,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 11:24:37,259 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 11:24:37,299 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 11:24:37,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:24:43,378 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 11:24:45,396 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 11:24:47,404 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 11:24:47,771 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 11:24:47,791 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:24:47,791 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 11:24:47,795 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 11:24:47,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890267249] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:24:47,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:24:47,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-05-04 11:24:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928707168] [2023-05-04 11:24:47,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:24:47,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 11:24:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:24:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 11:24:47,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=361, Unknown=6, NotChecked=120, Total=552 [2023-05-04 11:24:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:47,796 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:24:47,797 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 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:24:47,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:55,877 WARN L233 SmtUtils]: Spent 8.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 11:25:09,949 WARN L233 SmtUtils]: Spent 14.04s 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 11:25:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:25:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:25:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:25:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:25:10,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 11:25:10,294 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 11:25:10,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:25:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:25:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2118492515, now seen corresponding path program 1 times [2023-05-04 11:25:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:25:10,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315874543] [2023-05-04 11:25:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:25:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:25:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:25:11,632 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 11:25:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:25:11,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315874543] [2023-05-04 11:25:11,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315874543] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:25:11,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573254956] [2023-05-04 11:25:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:25:11,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:25:11,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:25:11,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:25:11,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 11:25:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:25:11,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-04 11:25:11,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:25:11,789 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 11:25:12,055 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:25:12,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:25:12,100 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 11:25:12,207 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 11:25:12,417 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 11:25:12,464 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 11:25:12,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:25:18,659 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 11:25:18,988 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 11:25:19,013 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:25:19,013 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 11:25:19,016 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 11:25:19,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573254956] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:25:19,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:25:19,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 40 [2023-05-04 11:25:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623245126] [2023-05-04 11:25:19,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:25:19,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 11:25:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:25:19,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 11:25:19,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1320, Unknown=3, NotChecked=74, Total=1560 [2023-05-04 11:25:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:25:19,017 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:25:19,018 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 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:25:19,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:25:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 11:25:20,246 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 11:25:20,441 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 11:25:20,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:25:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:25:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1151407817, now seen corresponding path program 1 times [2023-05-04 11:25:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:25:20,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143896196] [2023-05-04 11:25:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:25:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:25:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:25:23,703 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 11:25:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:25:23,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143896196] [2023-05-04 11:25:23,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143896196] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:25:23,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013886322] [2023-05-04 11:25:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:25:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:25:23,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:25:23,705 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 11:25:23,705 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 11:25:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:25:23,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-04 11:25:23,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:25:23,881 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 11:25:24,128 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:25:24,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:25:24,173 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 11:25:24,280 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 11:25:24,609 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 11:25:24,747 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 11:25:34,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-05-04 11:25:34,370 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 11:25:34,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:25:40,303 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 11:25:42,038 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 11:25:44,073 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 11:25:46,165 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 11:25:50,514 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 11:25:51,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:25:51,099 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 11:25:51,133 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:25:51,134 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 11:25:51,137 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 11:25:51,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013886322] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:25:51,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:25:51,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 19] total 58 [2023-05-04 11:25:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295768347] [2023-05-04 11:25:51,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:25:51,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-04 11:25:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:25:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-04 11:25:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2465, Unknown=17, NotChecked=530, Total=3306 [2023-05-04 11:25:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:25:51,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:25:51,140 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 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 11:25:51,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:26:22,612 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 80 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:26:34,923 WARN L233 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 81 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:26:49,207 WARN L233 SmtUtils]: Spent 14.12s 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 11:27:00,339 WARN L233 SmtUtils]: Spent 8.75s 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 11:29:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:29:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:29:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:29:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:29:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:29:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:29:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:29:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 11:29:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-05-04 11:29:28,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 11:29:28,918 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 11:29:28,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:29:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:29:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1050622548, now seen corresponding path program 2 times [2023-05-04 11:29:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:29:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124244466] [2023-05-04 11:29:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:29:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:29:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:29:44,484 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 11:29:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:29:44,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124244466] [2023-05-04 11:29:44,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124244466] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:29:44,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69476509] [2023-05-04 11:29:44,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:29:44,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:29:44,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:29:44,486 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 11:29:44,486 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 11:29:44,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:29:44,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:29:44,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-04 11:29:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:29:44,739 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 11:29:45,022 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:29:45,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:29:45,070 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 11:29:45,210 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 11:29:45,667 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 11:29:45,776 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 11:30:26,189 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 11:30:28,638 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 11:32:54,931 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 11:32:55,030 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 11:32:55,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:33:01,183 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 11:33:03,192 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 11:33:05,282 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 11:33:07,292 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 11:33:09,327 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 11:33:11,412 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 11:33:13,437 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 11:33:15,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_47|)) (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 (* |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_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 11:33:17,380 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 11:33:19,656 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 11:33:21,673 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 11:33:22,562 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 11:33:24,777 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 11:33:29,531 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 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1236))) (or (= (select (store (store (select .cse0 |c_~#cache~0.base|) |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 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |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 11:33:29,587 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 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1236))) (or (= (select (store (store (select .cse0 |c_~#cache~0.base|) |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 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |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 11:33:30,846 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:33:30,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:33:30,852 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:33:30,852 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 11:33:30,908 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:33:30,908 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 11:33:30,912 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 11:33:30,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69476509] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:33:30,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:33:30,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 32] total 94 [2023-05-04 11:33:30,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477327977] [2023-05-04 11:33:30,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:33:30,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-05-04 11:33:30,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:33:30,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-05-04 11:33:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=5546, Unknown=131, NotChecked=2520, Total=8742 [2023-05-04 11:33:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:33:30,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:33:30,918 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 11:33:30,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:33:30,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:33:30,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-05-04 11:33:30,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:35:11,736 WARN L233 SmtUtils]: Spent 18.21s on a formula simplification. DAG size of input: 153 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:35:31,763 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 142 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:36:50,270 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 64 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:37:13,348 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 68 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:37:46,026 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:38:00,900 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 104 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:38:27,482 WARN L233 SmtUtils]: Spent 22.36s on a formula simplification. DAG size of input: 112 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:38:42,244 WARN L233 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 102 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:38:58,547 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 110 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 11:39:02,787 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 11:39:02,798 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:39:02,798 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:39:03,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 11:39:03,823 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 11:39:03,998 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-05-04 11:39:04,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 11:39:04,013 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-05-04 11:39:04,015 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 11:39:04,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-05-04 11:39:04,018 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2023-05-04 11:39:04,019 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-05-04 11:39:04,020 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 11:39:04,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 11:39:04,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 11:39:04 BasicIcfg [2023-05-04 11:39:04,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 11:39:04,022 INFO L158 Benchmark]: Toolchain (without parser) took 873600.51ms. Allocated memory was 194.0MB in the beginning and 460.3MB in the end (delta: 266.3MB). Free memory was 163.6MB in the beginning and 167.5MB in the end (delta: -4.0MB). Peak memory consumption was 261.6MB. Max. memory is 8.0GB. [2023-05-04 11:39:04,022 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 11:39:04,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.36ms. Allocated memory was 194.0MB in the beginning and 272.6MB in the end (delta: 78.6MB). Free memory was 163.6MB in the beginning and 221.5MB in the end (delta: -57.9MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. [2023-05-04 11:39:04,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 272.6MB. Free memory was 221.1MB in the beginning and 218.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 11:39:04,023 INFO L158 Benchmark]: Boogie Preprocessor took 37.05ms. Allocated memory is still 272.6MB. Free memory was 218.4MB in the beginning and 215.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 11:39:04,023 INFO L158 Benchmark]: RCFGBuilder took 521.48ms. Allocated memory is still 272.6MB. Free memory was 215.9MB in the beginning and 195.3MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-04 11:39:04,023 INFO L158 Benchmark]: TraceAbstraction took 872478.20ms. Allocated memory was 272.6MB in the beginning and 460.3MB in the end (delta: 187.7MB). Free memory was 194.2MB in the beginning and 167.5MB in the end (delta: 26.7MB). Peak memory consumption was 214.3MB. Max. memory is 8.0GB. [2023-05-04 11:39:04,024 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.09ms. Allocated memory is still 194.0MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.36ms. Allocated memory was 194.0MB in the beginning and 272.6MB in the end (delta: 78.6MB). Free memory was 163.6MB in the beginning and 221.5MB in the end (delta: -57.9MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 272.6MB. Free memory was 221.1MB in the beginning and 218.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.05ms. Allocated memory is still 272.6MB. Free memory was 218.4MB in the beginning and 215.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 521.48ms. Allocated memory is still 272.6MB. Free memory was 215.9MB in the beginning and 195.3MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 872478.20ms. Allocated memory was 272.6MB in the beginning and 460.3MB in the end (delta: 187.7MB). Free memory was 194.2MB in the beginning and 167.5MB in the end (delta: 26.7MB). Peak memory consumption was 214.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20821, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 1588, dependent conditional: 1541, 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: 221, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 126, dependent conditional: 0, dependent unconditional: 126, 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: 1526 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, 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: 20821, independent: 19233, independent conditional: 2106, independent unconditional: 17127, dependent: 1588, dependent conditional: 1541, 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: 221, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 126, dependent conditional: 0, dependent unconditional: 126, 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: 1526 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - 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: 872.4s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 575.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: 206, 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.5s SatisfiabilityAnalysisTime, 293.7s 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