/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 10:29:44,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 10:29:44,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 10:29:44,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 10:29:44,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 10:29:44,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 10:29:44,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 10:29:44,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 10:29:44,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 10:29:44,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 10:29:44,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 10:29:44,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 10:29:44,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 10:29:44,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 10:29:44,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 10:29:44,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 10:29:44,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 10:29:44,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 10:29:44,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 10:29:44,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 10:29:44,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 10:29:44,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 10:29:44,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 10:29:44,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 10:29:44,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 10:29:44,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 10:29:44,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 10:29:44,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 10:29:44,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 10:29:44,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 10:29:44,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 10:29:44,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 10:29:44,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 10:29:44,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 10:29:44,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 10:29:44,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 10:29:44,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 10:29:44,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 10:29:44,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 10:29:44,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 10:29:44,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 10:29:44,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 10:29:44,930 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 10:29:44,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 10:29:44,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 10:29:44,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 10:29:44,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 10:29:44,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 10:29:44,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 10:29:44,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 10:29:44,932 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 10:29:44,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 10:29:44,932 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 10:29:44,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 10:29:44,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 10:29:44,934 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 10:29:44,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 10:29:44,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 10:29:44,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 10:29:44,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 10:29:44,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 10:29:44,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 10:29:44,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 10:29:44,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 10:29:44,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 10:29:44,935 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 10:29:44,935 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 10:29:44,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 10:29:44,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 10:29:44,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 10:29:44,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 10:29:44,936 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 10:29:44,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-20 10:29:45,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 10:29:45,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 10:29:45,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 10:29:45,195 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 10:29:45,196 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 10:29:45,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-05-20 10:29:45,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1cd6caf/be9b847b6eae45b8814a859510dba9a7/FLAGaa7bb9b5f [2023-05-20 10:29:45,758 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 10:29:45,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-05-20 10:29:45,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1cd6caf/be9b847b6eae45b8814a859510dba9a7/FLAGaa7bb9b5f [2023-05-20 10:29:46,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1cd6caf/be9b847b6eae45b8814a859510dba9a7 [2023-05-20 10:29:46,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 10:29:46,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 10:29:46,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 10:29:46,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 10:29:46,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 10:29:46,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5476e618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46, skipping insertion in model container [2023-05-20 10:29:46,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 10:29:46,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 10:29:46,531 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_70-funloop_racefree.i[41323,41336] [2023-05-20 10:29:46,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 10:29:46,589 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 10:29:46,626 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_70-funloop_racefree.i[41323,41336] [2023-05-20 10:29:46,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 10:29:46,671 INFO L208 MainTranslator]: Completed translation [2023-05-20 10:29:46,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46 WrapperNode [2023-05-20 10:29:46,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 10:29:46,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 10:29:46,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 10:29:46,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 10:29:46,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,727 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2023-05-20 10:29:46,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 10:29:46,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 10:29:46,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 10:29:46,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 10:29:46,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 10:29:46,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 10:29:46,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 10:29:46,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 10:29:46,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (1/1) ... [2023-05-20 10:29:46,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 10:29:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:46,796 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-20 10:29:46,820 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-20 10:29:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 10:29:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 10:29:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 10:29:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 10:29:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 10:29:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 10:29:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-20 10:29:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-20 10:29:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 10:29:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 10:29:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 10:29:46,839 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 10:29:47,004 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 10:29:47,009 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 10:29:47,272 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 10:29:47,280 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 10:29:47,280 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2023-05-20 10:29:47,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 10:29:47 BoogieIcfgContainer [2023-05-20 10:29:47,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 10:29:47,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 10:29:47,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 10:29:47,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 10:29:47,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 10:29:46" (1/3) ... [2023-05-20 10:29:47,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bbd309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 10:29:47, skipping insertion in model container [2023-05-20 10:29:47,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 10:29:46" (2/3) ... [2023-05-20 10:29:47,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bbd309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 10:29:47, skipping insertion in model container [2023-05-20 10:29:47,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 10:29:47" (3/3) ... [2023-05-20 10:29:47,290 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-05-20 10:29:47,298 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 10:29:47,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 10:29:47,307 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-20 10:29:47,307 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 10:29:47,371 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-20 10:29:47,414 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 10:29:47,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 10:29:47,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:47,421 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-20 10:29:47,454 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-20 10:29:47,486 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 10:29:47,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-20 10:29:47,508 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;@f94cee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 10:29:47,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 10:29:47,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:47,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash -439351920, now seen corresponding path program 1 times [2023-05-20 10:29:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:47,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725551385] [2023-05-20 10:29:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-20 10:29:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:48,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725551385] [2023-05-20 10:29:48,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725551385] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 10:29:48,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 10:29:48,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 10:29:48,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800401466] [2023-05-20 10:29:48,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 10:29:48,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 10:29:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:29:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 10:29:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 10:29:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:48,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:29:48,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-20 10:29:48,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:48,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 10:29:48,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1006033356, now seen corresponding path program 1 times [2023-05-20 10:29:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:48,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247148882] [2023-05-20 10:29:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-20 10:29:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:48,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247148882] [2023-05-20 10:29:48,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247148882] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:29:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22991199] [2023-05-20 10:29:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:48,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:29:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:48,391 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-20 10:29:48,392 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-20 10:29:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:48,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-20 10:29:48,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:29:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 10:29:48,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 10:29:48,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22991199] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 10:29:48,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 10:29:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-20 10:29:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388793088] [2023-05-20 10:29:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 10:29:48,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 10:29:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:29:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 10:29:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 10:29:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:48,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:29:48,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-20 10:29:48,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:48,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:48,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 10:29:49,057 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-20 10:29:49,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1442750082, now seen corresponding path program 1 times [2023-05-20 10:29:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:49,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517372334] [2023-05-20 10:29:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-20 10:29:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:49,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517372334] [2023-05-20 10:29:49,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517372334] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:29:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676086] [2023-05-20 10:29:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:29:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:49,303 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-20 10:29:49,313 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-20 10:29:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:49,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-20 10:29:49,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:29:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-20 10:29:49,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 10:29:49,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676086] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 10:29:49,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 10:29:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-20 10:29:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087193579] [2023-05-20 10:29:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 10:29:49,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 10:29:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:29:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 10:29:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 10:29:49,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:49,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:29:49,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 10:29:49,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:49,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:49,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:49,530 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-20 10:29:49,730 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-20 10:29:49,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:49,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 992259687, now seen corresponding path program 1 times [2023-05-20 10:29:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:49,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571723157] [2023-05-20 10:29:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-20 10:29:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:49,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571723157] [2023-05-20 10:29:49,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571723157] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:29:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865983197] [2023-05-20 10:29:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:49,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:29:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:49,896 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-20 10:29:49,899 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-20 10:29:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:50,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 10:29:50,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:29:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-20 10:29:50,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:29:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-20 10:29:50,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865983197] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:29:50,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:29:50,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 10:29:50,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917878915] [2023-05-20 10:29:50,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:29:50,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 10:29:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:29:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 10:29:50,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 10:29:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:50,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:29:50,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 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-20 10:29:50,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:29:50,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 10:29:50,429 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-20 10:29:50,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:50,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1761525223, now seen corresponding path program 2 times [2023-05-20 10:29:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:50,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218909163] [2023-05-20 10:29:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-05-20 10:29:50,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:50,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218909163] [2023-05-20 10:29:50,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218909163] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:29:50,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788966692] [2023-05-20 10:29:50,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 10:29:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:29:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:50,609 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-20 10:29:50,624 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-20 10:29:50,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 10:29:50,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 10:29:50,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 10:29:50,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:29:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-20 10:29:50,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:29:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-20 10:29:50,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788966692] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:29:50,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:29:50,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-20 10:29:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663388320] [2023-05-20 10:29:50,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:29:50,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-20 10:29:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:29:50,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-20 10:29:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-20 10:29:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:50,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:29:50,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 states have internal predecessors, (189), 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-20 10:29:50,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:50,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:29:50,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:29:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:29:51,260 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-20 10:29:51,448 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-20 10:29:51,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -20893282, now seen corresponding path program 1 times [2023-05-20 10:29:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:51,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651253249] [2023-05-20 10:29:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:51,764 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-20 10:29:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651253249] [2023-05-20 10:29:51,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651253249] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:29:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006766109] [2023-05-20 10:29:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:29:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:51,769 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-20 10:29:51,773 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-20 10:29:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:51,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 10:29:51,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:29:51,952 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-20 10:29:51,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:29:52,162 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-20 10:29:52,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006766109] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:29:52,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:29:52,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-20 10:29:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3343480] [2023-05-20 10:29:52,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:29:52,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 10:29:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:29:52,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 10:29:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 10:29:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:52,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:29:52,165 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-20 10:29:52,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:52,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:52,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:52,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:29:52,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:29:52,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:29:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:29:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:29:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:29:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:29:52,466 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-20 10:29:52,661 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-20 10:29:52,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:29:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:29:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1476590674, now seen corresponding path program 2 times [2023-05-20 10:29:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:29:52,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425969078] [2023-05-20 10:29:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:29:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:29:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:29:53,226 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-20 10:29:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:29:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425969078] [2023-05-20 10:29:53,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425969078] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:29:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125341542] [2023-05-20 10:29:53,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 10:29:53,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:29:53,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:29:53,228 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-20 10:29:53,240 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-20 10:29:53,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 10:29:53,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 10:29:53,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2023-05-20 10:29:53,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:29:53,435 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-20 10:29:54,023 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-20 10:29:54,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 10:29:54,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 10:29:54,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 10:29:54,333 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-20 10:29:54,384 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-20 10:29:54,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:30:04,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_551 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_551) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-20 10:30:06,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_551 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_551) |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-20 10:30:08,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_551 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_551) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-20 10:30:09,173 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-20 10:30:09,229 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-20 10:30:09,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125341542] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:30:09,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:30:09,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 30 [2023-05-20 10:30:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894446660] [2023-05-20 10:30:09,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:30:09,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-20 10:30:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:30:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-20 10:30:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=602, Unknown=7, NotChecked=156, Total=870 [2023-05-20 10:30:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:30:09,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:30:09,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.266666666666667) internal successors, (188), 30 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 10:30:09,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:09,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:09,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:09,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:30:09,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:30:09,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:30:09,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:30:45,457 WARN L233 SmtUtils]: Spent 36.08s on a formula simplification. DAG size of input: 35 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:30:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:30:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:30:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:30:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-20 10:30:45,712 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-20 10:30:45,901 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-20 10:30:45,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:30:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:30:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 456666289, now seen corresponding path program 1 times [2023-05-20 10:30:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:30:45,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345377888] [2023-05-20 10:30:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:30:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:30:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:30:47,566 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-20 10:30:47,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:30:47,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345377888] [2023-05-20 10:30:47,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345377888] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:30:47,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845044126] [2023-05-20 10:30:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:30:47,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:30:47,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:30:47,573 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-20 10:30:47,575 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-20 10:30:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:30:47,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-20 10:30:47,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:30:47,746 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-20 10:30:48,089 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 10:30:48,089 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-20 10:30:48,144 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-20 10:30:48,283 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-20 10:30:48,527 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-20 10:30:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-20 10:30:48,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:30:54,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_632) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-20 10:30:55,209 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-20 10:30:55,245 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 10:30:55,246 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-20 10:30:55,249 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-20 10:30:55,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845044126] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:30:55,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:30:55,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 40 [2023-05-20 10:30:55,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371106146] [2023-05-20 10:30:55,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:30:55,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-20 10:30:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:30:55,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-20 10:30:55,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1320, Unknown=3, NotChecked=74, Total=1560 [2023-05-20 10:30:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:30:55,252 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:30:55,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.525) internal successors, (261), 40 states have internal predecessors, (261), 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-20 10:30:55,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:55,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:55,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:30:55,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:30:55,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:30:55,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:30:55,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-20 10:30:55,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:31:05,465 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:31:19,510 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:31:41,551 WARN L233 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:31:57,619 WARN L233 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 35 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:32:15,690 WARN L233 SmtUtils]: Spent 18.05s on a formula simplification. DAG size of input: 37 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:32:27,756 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 39 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:32:50,016 WARN L233 SmtUtils]: Spent 18.08s on a formula simplification. DAG size of input: 43 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:33:02,156 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 46 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:33:14,267 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 34 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:33:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:33:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-20 10:33:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 10:33:15,237 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-20 10:33:15,414 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-20 10:33:15,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:33:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:33:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash -935011107, now seen corresponding path program 1 times [2023-05-20 10:33:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:33:15,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569811495] [2023-05-20 10:33:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:33:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:33:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:33:19,730 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-20 10:33:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:33:19,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569811495] [2023-05-20 10:33:19,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569811495] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:33:19,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899158957] [2023-05-20 10:33:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:33:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:33:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:33:19,732 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-20 10:33:19,732 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-20 10:33:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:33:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-20 10:33:19,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:33:19,923 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-20 10:33:20,214 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 10:33:20,215 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-20 10:33:20,260 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-20 10:33:20,377 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-20 10:33:20,790 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-20 10:33:20,897 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-20 10:33:31,026 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-20 10:33:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2023-05-20 10:33:31,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:33:37,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-20 10:33:39,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 10:33:41,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_764)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 10:33:43,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (= (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_49| v_ArrVal_764)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 10:33:49,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_761 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_761) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_764) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0))) is different from false [2023-05-20 10:33:50,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 10:33:50,439 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-20 10:33:50,479 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 10:33:50,480 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-20 10:33:50,484 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-20 10:33:50,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899158957] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:33:50,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:33:50,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 19] total 58 [2023-05-20 10:33:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850396059] [2023-05-20 10:33:50,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:33:50,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-20 10:33:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:33:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-20 10:33:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2465, Unknown=17, NotChecked=530, Total=3306 [2023-05-20 10:33:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:33:50,487 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:33:50,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.017241379310345) internal successors, (407), 58 states have internal predecessors, (407), 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-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 10:33:50,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:34:08,286 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 90 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:36:22,253 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (or (= .cse0 .cse1) (let ((.cse2 (@diff .cse1 .cse0))) (let ((.cse4 (store .cse1 .cse2 0))) (let ((.cse5 (@diff .cse4 .cse0)) (.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (and (<= (+ .cse2 24) .cse3) (= .cse0 (store .cse4 .cse5 0)) (or (<= (+ .cse5 24) .cse3) (= .cse0 .cse4)))))))) (exists ((v_ArrVal_764 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_764)))) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int)) (or (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) (= |c_~#cache~0.base| 3))) is different from false [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-20 10:36:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 10:36:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-20 10:36:24,387 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-20 10:36:24,572 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-20 10:36:24,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 10:36:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 10:36:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1302088472, now seen corresponding path program 2 times [2023-05-20 10:36:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 10:36:24,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164732694] [2023-05-20 10:36:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 10:36:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 10:36:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 10:36:42,493 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-20 10:36:42,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 10:36:42,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164732694] [2023-05-20 10:36:42,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164732694] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 10:36:42,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303387724] [2023-05-20 10:36:42,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 10:36:42,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 10:36:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 10:36:42,495 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-20 10:36:42,495 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-20 10:36:42,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 10:36:42,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 10:36:42,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-20 10:36:42,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 10:36:42,761 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-20 10:36:43,070 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 10:36:43,071 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-20 10:36:43,118 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-20 10:36:43,258 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-20 10:36:43,732 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-20 10:36:43,854 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-20 10:37:22,788 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-20 10:37:25,156 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-20 10:39:51,052 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-20 10:39:51,173 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-20 10:39:51,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 10:39:55,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-20 10:39:57,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 10:39:59,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0))) is different from false [2023-05-20 10:40:01,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-20 10:40:03,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_965 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_965)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0))) is different from false [2023-05-20 10:40:05,599 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_58| Int) (v_ArrVal_965 Int)) (or (= (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_62| v_ArrVal_965)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-20 10:40:07,617 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_58| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2023-05-20 10:40:09,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_45| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_45|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))))) is different from false [2023-05-20 10:40:11,682 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_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-20 10:40:14,004 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_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-20 10:40:16,024 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_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-20 10:40:16,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_962)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-20 10:40:19,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int) (v_ArrVal_965 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ 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_66| v_ArrVal_962)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-20 10:40:23,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_958 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_965 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_958))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (= (select (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_962) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 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_58| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|))))) is different from false [2023-05-20 10:40:24,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_958 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_965 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_958) |c_~#cache~0.base|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (= (select (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_962) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_965) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)) (not (= (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))) is different from false [2023-05-20 10:40:25,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 10:40:25,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 10:40:25,445 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 10:40:25,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-05-20 10:40:25,500 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 10:40:25,500 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-20 10:40:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 248 trivial. 357 not checked. [2023-05-20 10:40:25,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303387724] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 10:40:25,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 10:40:25,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 32] total 94 [2023-05-20 10:40:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35743952] [2023-05-20 10:40:25,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 10:40:25,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-05-20 10:40:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 10:40:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-05-20 10:40:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=5545, Unknown=132, NotChecked=2520, Total=8742 [2023-05-20 10:40:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:40:25,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 10:40:25,511 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-20 10:40:25,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:40:25,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-20 10:40:25,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 10:41:53,527 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 92 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:42:25,371 WARN L233 SmtUtils]: Spent 19.84s 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-20 10:42:41,954 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification. DAG size of input: 137 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 10:43:42,680 WARN L233 SmtUtils]: Spent 6.59s 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-20 10:43:54,921 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 73 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-20 10:44:05,155 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-20 10:44:05,158 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-20 10:44:05,158 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-20 10:44:06,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-20 10:44:06,205 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-20 10:44:06,373 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-20 10:44:06,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-20 10:44:06,390 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-05-20 10:44:06,392 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 10:44:06,393 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-20 10:44:06,397 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2023-05-20 10:44:06,398 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-05-20 10:44:06,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 10:44:06,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 10:44:06,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 10:44:06 BasicIcfg [2023-05-20 10:44:06,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 10:44:06,402 INFO L158 Benchmark]: Toolchain (without parser) took 860340.43ms. Allocated memory was 187.7MB in the beginning and 446.7MB in the end (delta: 259.0MB). Free memory was 130.5MB in the beginning and 307.9MB in the end (delta: -177.5MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. [2023-05-20 10:44:06,402 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 10:44:06,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.11ms. Allocated memory is still 187.7MB. Free memory was 130.3MB in the beginning and 143.3MB in the end (delta: -13.0MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2023-05-20 10:44:06,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.15ms. Allocated memory is still 187.7MB. Free memory was 143.3MB in the beginning and 140.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 10:44:06,402 INFO L158 Benchmark]: Boogie Preprocessor took 38.76ms. Allocated memory is still 187.7MB. Free memory was 140.4MB in the beginning and 138.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 10:44:06,403 INFO L158 Benchmark]: RCFGBuilder took 515.13ms. Allocated memory is still 187.7MB. Free memory was 138.3MB in the beginning and 119.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-05-20 10:44:06,403 INFO L158 Benchmark]: TraceAbstraction took 859116.81ms. Allocated memory was 187.7MB in the beginning and 446.7MB in the end (delta: 259.0MB). Free memory was 118.9MB in the beginning and 307.9MB in the end (delta: -189.1MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. [2023-05-20 10:44:06,404 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.14ms. Allocated memory is still 187.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 609.11ms. Allocated memory is still 187.7MB. Free memory was 130.3MB in the beginning and 143.3MB in the end (delta: -13.0MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.15ms. Allocated memory is still 187.7MB. Free memory was 143.3MB in the beginning and 140.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.76ms. Allocated memory is still 187.7MB. Free memory was 140.4MB in the beginning and 138.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 515.13ms. Allocated memory is still 187.7MB. Free memory was 138.3MB in the beginning and 119.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 859116.81ms. Allocated memory was 187.7MB in the beginning and 446.7MB in the end (delta: 259.0MB). Free memory was 118.9MB in the beginning and 307.9MB in the end (delta: -189.1MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14875, independent: 13790, independent conditional: 821, independent unconditional: 12969, dependent: 1085, dependent conditional: 1056, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 821, independent unconditional: 12969, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 821, independent unconditional: 12969, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 0, independent unconditional: 13790, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 0, independent unconditional: 13790, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 0, independent unconditional: 13790, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7757, independent: 7728, independent conditional: 0, independent unconditional: 7728, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7757, independent: 7718, independent conditional: 0, independent unconditional: 7718, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13819, independent: 6062, independent conditional: 0, independent unconditional: 6062, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7757, unknown conditional: 0, unknown unconditional: 7757] , Statistics on independence cache: Total cache size (in pairs): 7757, Positive cache size: 7728, Positive conditional cache size: 0, Positive unconditional cache size: 7728, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1056 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 329, Number of trivial persistent sets: 270, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12998, independent: 12969, independent conditional: 0, independent unconditional: 12969, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14875, independent: 13790, independent conditional: 821, independent unconditional: 12969, dependent: 1085, dependent conditional: 1056, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 821, independent unconditional: 12969, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 821, independent unconditional: 12969, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 0, independent unconditional: 13790, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 0, independent unconditional: 13790, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13819, independent: 13790, independent conditional: 0, independent unconditional: 13790, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7757, independent: 7728, independent conditional: 0, independent unconditional: 7728, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7757, independent: 7718, independent conditional: 0, independent unconditional: 7718, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13819, independent: 6062, independent conditional: 0, independent unconditional: 6062, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7757, unknown conditional: 0, unknown unconditional: 7757] , Statistics on independence cache: Total cache size (in pairs): 7757, Positive cache size: 7728, Positive conditional cache size: 0, Positive unconditional cache size: 7728, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1056 - 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, 226 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 858.9s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 552.3s, 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: 212, 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.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 302.9s InterpolantComputationTime, 3125 NumberOfCodeBlocks, 3125 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4324 ConstructedInterpolants, 836 QuantifiedInterpolants, 152023 SizeOfPredicates, 115 NumberOfNonLiveVariables, 3478 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 3508/5369 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