/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 08:25:18,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 08:25:18,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 08:25:18,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 08:25:18,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 08:25:18,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 08:25:18,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 08:25:18,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 08:25:18,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 08:25:18,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 08:25:18,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 08:25:18,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 08:25:18,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 08:25:18,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 08:25:18,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 08:25:18,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 08:25:18,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 08:25:18,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 08:25:18,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 08:25:18,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 08:25:18,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 08:25:18,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 08:25:18,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 08:25:18,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 08:25:18,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 08:25:18,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 08:25:18,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 08:25:18,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 08:25:18,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 08:25:18,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 08:25:18,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 08:25:18,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 08:25:18,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 08:25:18,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 08:25:18,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 08:25:18,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 08:25:18,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 08:25:18,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 08:25:18,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 08:25:18,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 08:25:18,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 08:25:18,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 08:25:18,173 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 08:25:18,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 08:25:18,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 08:25:18,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 08:25:18,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 08:25:18,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 08:25:18,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 08:25:18,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 08:25:18,176 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 08:25:18,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 08:25:18,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 08:25:18,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 08:25:18,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:25:18,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 08:25:18,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 08:25:18,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 08:25:18,179 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 08:25:18,179 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 08:25:18,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 08:25:18,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 08:25:18,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 08:25:18,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 08:25:18,180 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 08:25:18,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-04 08:25:18,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 08:25:18,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 08:25:18,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 08:25:18,457 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 08:25:18,458 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 08:25:18,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-05-04 08:25:18,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec548d9c/838dd89f66dd46b8851e9f27d09ee1e3/FLAG31c27e2eb [2023-05-04 08:25:18,986 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 08:25:18,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-05-04 08:25:19,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec548d9c/838dd89f66dd46b8851e9f27d09ee1e3/FLAG31c27e2eb [2023-05-04 08:25:19,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec548d9c/838dd89f66dd46b8851e9f27d09ee1e3 [2023-05-04 08:25:19,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 08:25:19,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 08:25:19,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 08:25:19,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 08:25:19,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 08:25:19,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71487e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19, skipping insertion in model container [2023-05-04 08:25:19,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 08:25:19,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 08:25:19,695 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_76-tricky_address3_racefree.i[41323,41336] [2023-05-04 08:25:19,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:25:19,751 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 08:25:19,784 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_76-tricky_address3_racefree.i[41323,41336] [2023-05-04 08:25:19,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 08:25:19,858 INFO L208 MainTranslator]: Completed translation [2023-05-04 08:25:19,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19 WrapperNode [2023-05-04 08:25:19,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 08:25:19,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 08:25:19,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 08:25:19,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 08:25:19,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,944 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 189 [2023-05-04 08:25:19,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 08:25:19,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 08:25:19,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 08:25:19,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 08:25:19,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,986 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:19,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:20,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 08:25:20,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 08:25:20,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 08:25:20,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 08:25:20,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (1/1) ... [2023-05-04 08:25:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 08:25:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:20,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 08:25:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 08:25:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 08:25:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 08:25:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 08:25:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 08:25:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 08:25:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 08:25:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 08:25:20,087 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 08:25:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 08:25:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 08:25:20,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 08:25:20,088 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 08:25:20,269 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 08:25:20,271 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 08:25:20,592 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 08:25:20,599 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 08:25:20,600 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2023-05-04 08:25:20,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:25:20 BoogieIcfgContainer [2023-05-04 08:25:20,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 08:25:20,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 08:25:20,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 08:25:20,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 08:25:20,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:25:19" (1/3) ... [2023-05-04 08:25:20,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b3fd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:25:20, skipping insertion in model container [2023-05-04 08:25:20,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:25:19" (2/3) ... [2023-05-04 08:25:20,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b3fd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:25:20, skipping insertion in model container [2023-05-04 08:25:20,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:25:20" (3/3) ... [2023-05-04 08:25:20,618 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-05-04 08:25:20,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 08:25:20,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 08:25:20,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-04 08:25:20,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 08:25:20,683 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 08:25:20,725 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:20,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 08:25:20,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 08:25:20,764 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:20,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 08:25:20,785 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;@7494e0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:20,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:25:20,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash -338934369, now seen corresponding path program 1 times [2023-05-04 08:25:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:20,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642230408] [2023-05-04 08:25:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642230408] [2023-05-04 08:25:21,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642230408] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:21,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:21,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:21,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629747855] [2023-05-04 08:25:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:21,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:21,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:21,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:21,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:21,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 08:25:21,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1491447692, now seen corresponding path program 1 times [2023-05-04 08:25:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:21,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963429621] [2023-05-04 08:25:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:21,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:21,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963429621] [2023-05-04 08:25:21,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963429621] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:21,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641694877] [2023-05-04 08:25:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:21,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:21,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:21,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 08:25:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:21,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:21,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:21,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:21,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641694877] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:21,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:21,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943266098] [2023-05-04 08:25:21,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:21,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:21,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:21,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:21,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:21,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:21,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:21,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 08:25:22,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 08:25:22,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash -954887340, now seen corresponding path program 2 times [2023-05-04 08:25:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:22,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600364851] [2023-05-04 08:25:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:25:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:22,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600364851] [2023-05-04 08:25:22,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600364851] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:22,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913135294] [2023-05-04 08:25:22,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:22,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:22,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:22,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:22,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 08:25:22,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 08:25:22,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:22,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2023-05-04 08:25:22,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:22,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:22,849 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:22,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:22,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:23,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-05-04 08:25:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:23,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 08:25:23,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913135294] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:23,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 08:25:23,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2023-05-04 08:25:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343812432] [2023-05-04 08:25:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:23,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 08:25:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 08:25:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-05-04 08:25:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:23,067 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:23,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:23,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:23,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:23,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 08:25:23,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:23,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:23,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 639125310, now seen corresponding path program 1 times [2023-05-04 08:25:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:23,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897703969] [2023-05-04 08:25:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897703969] [2023-05-04 08:25:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897703969] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493403520] [2023-05-04 08:25:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:23,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:23,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 08:25:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:23,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:23,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:23,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:24,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493403520] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:24,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:24,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 08:25:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97097443] [2023-05-04 08:25:24,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:24,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 08:25:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 08:25:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 08:25:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:24,009 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:24,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.789473684210526) internal successors, (167), 19 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 08:25:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 08:25:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:24,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 08:25:24,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:24,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:24,659 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-05-04 08:25:24,660 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-05-04 08:25:24,664 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:24,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:24,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 08:25:24,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-05-04 08:25:24,670 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:24,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 08:25:24,673 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;@7494e0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:24,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 08:25:24,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1014650304, now seen corresponding path program 1 times [2023-05-04 08:25:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:24,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534151097] [2023-05-04 08:25:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:24,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:24,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534151097] [2023-05-04 08:25:24,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534151097] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:24,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:24,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:24,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380205637] [2023-05-04 08:25:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:24,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:24,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:24,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:24,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:24,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:24,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 08:25:24,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1795768870, now seen corresponding path program 1 times [2023-05-04 08:25:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825216498] [2023-05-04 08:25:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:24,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:24,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825216498] [2023-05-04 08:25:24,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825216498] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:24,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183148970] [2023-05-04 08:25:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:24,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:24,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:24,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:24,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 08:25:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:24,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:24,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:24,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:25,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183148970] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:25,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:25,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:25,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565920280] [2023-05-04 08:25:25,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:25,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:25,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:25,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:25,012 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:25,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:25,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:25,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:25,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:25,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1877295366, now seen corresponding path program 2 times [2023-05-04 08:25:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:25,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626708740] [2023-05-04 08:25:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626708740] [2023-05-04 08:25:25,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626708740] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079536918] [2023-05-04 08:25:25,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:25,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:25,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:25,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:25,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 08:25:25,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:25,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:25,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:25,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:25,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:25,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079536918] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:25,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:25,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 08:25:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188604327] [2023-05-04 08:25:25,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:25,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 08:25:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 08:25:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 08:25:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:25,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:25,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:25,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:25,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:25,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:25,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:25,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:25,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1665136326, now seen corresponding path program 3 times [2023-05-04 08:25:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:25,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676338580] [2023-05-04 08:25:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:26,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676338580] [2023-05-04 08:25:26,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676338580] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902516855] [2023-05-04 08:25:26,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 08:25:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:26,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:26,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 08:25:26,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-05-04 08:25:26,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:26,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:25:26,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:26,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902516855] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:26,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:26,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:25:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176991272] [2023-05-04 08:25:26,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:25:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:25:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:25:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:26,628 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:26,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 23 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:26,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:26,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:26,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:26,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:26,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:25:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:26,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:27,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-05-04 08:25:27,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 08:25:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1430535729, now seen corresponding path program 4 times [2023-05-04 08:25:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072418999] [2023-05-04 08:25:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:25:27,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 08:25:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 08:25:27,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 08:25:27,180 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 08:25:27,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 08:25:27,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-04 08:25:27,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 08:25:27,182 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2023-05-04 08:25:27,182 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-05-04 08:25:27,183 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 08:25:27,183 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 08:25:27,207 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 08:25:27,211 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:27,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 08:25:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:27,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 08:25:27,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-05-04 08:25:27,222 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 08:25:27,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-05-04 08:25:27,223 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;@7494e0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 08:25:27,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 08:25:27,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2138271331, now seen corresponding path program 1 times [2023-05-04 08:25:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:27,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737587272] [2023-05-04 08:25:27,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 08:25:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737587272] [2023-05-04 08:25:27,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737587272] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:27,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 08:25:27,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 08:25:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058724700] [2023-05-04 08:25:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:27,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:27,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 08:25:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:27,396 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:27,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:27,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 08:25:27,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2105757790, now seen corresponding path program 1 times [2023-05-04 08:25:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900786785] [2023-05-04 08:25:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900786785] [2023-05-04 08:25:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900786785] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055400981] [2023-05-04 08:25:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:27,649 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:27,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 08:25:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:27,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 08:25:27,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:27,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:27,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055400981] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:27,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:27,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 08:25:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793308636] [2023-05-04 08:25:27,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:27,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 08:25:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:27,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 08:25:27,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 08:25:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:27,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:27,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:27,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:27,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:28,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-04 08:25:28,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1970212002, now seen corresponding path program 2 times [2023-05-04 08:25:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:28,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877529561] [2023-05-04 08:25:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:28,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:28,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877529561] [2023-05-04 08:25:28,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877529561] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:28,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767952605] [2023-05-04 08:25:28,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:28,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:28,188 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:28,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 08:25:28,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 08:25:28,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:28,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 08:25:28,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:28,294 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 11 treesize of output 7 [2023-05-04 08:25:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-04 08:25:28,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 08:25:28,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767952605] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 08:25:28,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 08:25:28,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 08:25:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361662349] [2023-05-04 08:25:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 08:25:28,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 08:25:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 08:25:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 08:25:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:28,310 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:28,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:28,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:28,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:28,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-04 08:25:28,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -195104743, now seen corresponding path program 1 times [2023-05-04 08:25:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:28,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646795221] [2023-05-04 08:25:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 08:25:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646795221] [2023-05-04 08:25:28,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646795221] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:28,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173548400] [2023-05-04 08:25:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:28,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:28,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:28,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:28,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-04 08:25:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:28,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 08:25:28,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:28,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 08:25:28,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173548400] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:28,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:28,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 08:25:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717370866] [2023-05-04 08:25:28,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:28,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 08:25:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 08:25:28,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 08:25:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:28,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:28,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.842105263157896) internal successors, (168), 19 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:28,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:28,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:28,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:29,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:29,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 08:25:29,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2079151190, now seen corresponding path program 1 times [2023-05-04 08:25:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:29,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093492082] [2023-05-04 08:25:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:30,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:30,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093492082] [2023-05-04 08:25:30,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093492082] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:30,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238549760] [2023-05-04 08:25:30,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:30,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:30,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:30,265 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:30,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-04 08:25:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:30,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 08:25:30,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:30,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 08:25:30,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238549760] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:30,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:30,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 08:25:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779900799] [2023-05-04 08:25:30,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:30,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 08:25:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:30,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 08:25:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 08:25:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:30,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:30,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:30,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:30,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:30,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:30,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:30,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:30,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-04 08:25:31,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-05-04 08:25:31,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:25:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:25:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1395516130, now seen corresponding path program 2 times [2023-05-04 08:25:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:25:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631100628] [2023-05-04 08:25:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:25:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:25:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:25:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:25:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:25:31,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631100628] [2023-05-04 08:25:31,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631100628] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:25:31,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982311356] [2023-05-04 08:25:31,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:25:31,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:25:31,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:25:31,771 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:25:31,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-04 08:25:31,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:25:31,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:25:31,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2023-05-04 08:25:31,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:25:31,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:25:32,215 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:25:32,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:25:32,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:32,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:32,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:25:32,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-05-04 08:25:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-05-04 08:25:32,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:25:36,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_504) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:25:36,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_504) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:25:37,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 08:25:37,157 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:25:37,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:25:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 11 not checked. [2023-05-04 08:25:37,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982311356] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:25:37,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:25:37,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2023-05-04 08:25:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027451304] [2023-05-04 08:25:37,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:25:37,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-05-04 08:25:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:25:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-05-04 08:25:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=287, Unknown=3, NotChecked=70, Total=420 [2023-05-04 08:25:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:37,163 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:25:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.952380952380953) internal successors, (251), 21 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:25:37,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:37,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:25:37,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:25:37,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:25:37,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:25:37,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:25:45,236 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:26:03,295 WARN L233 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 28 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:26:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:26:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:26:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:26:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:26:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 08:26:03,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-04 08:26:03,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:26:03,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:26:03,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:26:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 207382147, now seen corresponding path program 1 times [2023-05-04 08:26:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:26:03,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313496872] [2023-05-04 08:26:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:26:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:26:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 08:27:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:27:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313496872] [2023-05-04 08:27:34,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313496872] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:27:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321056982] [2023-05-04 08:27:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:27:34,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:27:34,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:27:34,415 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:27:34,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-04 08:27:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:27:34,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-04 08:27:34,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:27:34,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:27:34,861 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:27:34,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:27:34,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:35,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:35,056 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 13 treesize of output 9 [2023-05-04 08:27:35,214 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:27:35,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2023-05-04 08:27:35,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:27:35,438 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 18 treesize of output 13 [2023-05-04 08:27:35,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 17 treesize of output 13 [2023-05-04 08:27:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:27:35,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:27:40,165 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 18 treesize of output 12 [2023-05-04 08:27:40,182 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_593 Int) (v_ArrVal_592 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_592))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_593))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_593 Int) (v_ArrVal_592 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_592))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_593))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-05-04 08:27:42,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_593 Int) (v_ArrVal_592 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_592) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_593) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-05-04 08:27:43,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:27:43,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2023-05-04 08:27:43,209 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:27:43,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:27:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 19 not checked. [2023-05-04 08:27:43,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321056982] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:27:43,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:27:43,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 15] total 61 [2023-05-04 08:27:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96297413] [2023-05-04 08:27:43,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:27:43,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-05-04 08:27:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:27:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-05-04 08:27:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3059, Unknown=9, NotChecked=230, Total=3660 [2023-05-04 08:27:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:27:43,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:27:43,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 6.213114754098361) internal successors, (379), 61 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:27:43,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:43,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:27:43,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:27:43,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:27:43,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:27:43,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 08:27:43,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:28:06,671 WARN L233 SmtUtils]: Spent 22.05s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:28:36,773 WARN L233 SmtUtils]: Spent 30.07s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:29:35,086 WARN L233 SmtUtils]: Spent 58.21s on a formula simplification. DAG size of input: 42 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:30:37,463 WARN L233 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 51 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:30:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:30:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 08:30:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-05-04 08:30:46,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-05-04 08:30:47,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-04 08:30:47,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:30:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:30:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash -589427315, now seen corresponding path program 1 times [2023-05-04 08:30:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:30:47,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984610879] [2023-05-04 08:30:47,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:30:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:30:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:30:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:30:47,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984610879] [2023-05-04 08:30:47,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984610879] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:30:47,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133584593] [2023-05-04 08:30:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:47,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:30:47,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:30:47,285 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:30:47,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-05-04 08:30:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:30:47,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 08:30:47,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:30:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:30:47,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:30:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:30:47,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133584593] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:30:47,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:30:47,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-05-04 08:30:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354909913] [2023-05-04 08:30:47,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:30:47,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-04 08:30:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:30:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-04 08:30:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-05-04 08:30:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:30:47,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:30:47,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.714285714285714) internal successors, (206), 14 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2023-05-04 08:30:47,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:30:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-05-04 08:30:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:30:54,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-05-04 08:30:54,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 08:30:54,755 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:30:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:30:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1901466249, now seen corresponding path program 1 times [2023-05-04 08:30:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:30:54,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058911058] [2023-05-04 08:30:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:30:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:30:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:30:55,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:30:55,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058911058] [2023-05-04 08:30:55,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058911058] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:30:55,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548692648] [2023-05-04 08:30:55,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:30:55,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:30:55,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:30:55,585 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:30:55,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-05-04 08:30:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:30:55,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-04 08:30:55,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:30:55,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:30:55,979 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:30:55,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:30:56,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:56,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:56,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:30:56,365 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 17 [2023-05-04 08:30:56,527 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 32 treesize of output 25 [2023-05-04 08:30:56,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-05-04 08:30:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:30:56,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:31:02,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:04,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:06,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:08,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:10,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:16,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_790 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_790) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:16,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_790 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_790) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:31:17,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 08:31:17,293 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:31:17,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:31:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 11 not checked. [2023-05-04 08:31:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548692648] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:31:17,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:31:17,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 41 [2023-05-04 08:31:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448755355] [2023-05-04 08:31:17,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:31:17,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-04 08:31:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:31:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-04 08:31:17,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=996, Unknown=9, NotChecked=490, Total=1640 [2023-05-04 08:31:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:31:17,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:31:17,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.414634146341463) internal successors, (345), 41 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:31:17,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:31:17,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:31:17,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:31:17,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:31:17,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:31:17,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:31:17,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2023-05-04 08:31:17,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:31:17,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:31:31,418 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:31:47,586 WARN L233 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 26 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:32:25,841 WARN L233 SmtUtils]: Spent 38.05s on a formula simplification. DAG size of input: 25 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:33:11,947 WARN L233 SmtUtils]: Spent 46.09s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:34:06,335 WARN L233 SmtUtils]: Spent 54.11s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 08:34:07,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-05-04 08:34:07,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-04 08:34:07,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:34:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:34:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 250657735, now seen corresponding path program 2 times [2023-05-04 08:34:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:34:07,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192563634] [2023-05-04 08:34:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:34:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:34:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:34:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:34:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:34:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192563634] [2023-05-04 08:34:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192563634] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:34:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956974585] [2023-05-04 08:34:09,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:34:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:34:09,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:34:09,126 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:34:09,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-05-04 08:34:09,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:34:09,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:34:09,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 34 conjunts are in the unsatisfiable core [2023-05-04 08:34:09,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:34:09,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:34:09,688 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:34:09,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:34:09,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:09,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:10,007 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 13 treesize of output 9 [2023-05-04 08:34:10,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:34:10,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:34:10,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:34:10,303 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 18 treesize of output 13 [2023-05-04 08:34:10,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 08:34:10,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 08:34:10,423 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:34:10,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2023-05-04 08:34:10,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-05-04 08:34:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:34:10,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:34:10,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_886) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-05-04 08:34:10,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_ArrVal_886 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_884)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_886) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-05-04 08:34:10,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_882))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_884))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_886) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-05-04 08:34:10,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:34:10,774 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-05-04 08:34:10,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:34:10,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 38 [2023-05-04 08:34:10,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-05-04 08:34:10,821 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_884 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_882 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_882))) (store .cse2 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_884))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_884 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_882 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_882))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_884))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2023-05-04 08:34:31,072 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:34:33,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_884 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_882 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_882) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_884) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (forall ((v_ArrVal_884 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_882 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_882) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_884) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-04 08:34:41,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-05-04 08:34:41,136 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 08:34:41,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2023-05-04 08:34:41,837 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 08:34:41,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-04 08:34:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 20 not checked. [2023-05-04 08:34:41,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956974585] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:34:41,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:34:41,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 43 [2023-05-04 08:34:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831708423] [2023-05-04 08:34:41,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:34:41,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-05-04 08:34:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:34:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-05-04 08:34:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1246, Unknown=23, NotChecked=380, Total=1806 [2023-05-04 08:34:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:34:41,847 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:34:41,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.674418604651163) internal successors, (330), 43 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 08:34:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:35:28,336 WARN L233 SmtUtils]: Spent 46.35s on a formula simplification. DAG size of input: 50 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:02,615 WARN L233 SmtUtils]: Spent 34.20s on a formula simplification. DAG size of input: 50 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:26,729 WARN L233 SmtUtils]: Spent 24.09s on a formula simplification. DAG size of input: 38 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:36:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-05-04 08:36:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:36:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-04 08:36:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:36:36,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-05-04 08:36:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:36:36,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 08:36:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 08:36:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -722298531, now seen corresponding path program 2 times [2023-05-04 08:36:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 08:36:36,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143585434] [2023-05-04 08:36:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 08:36:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 08:36:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 08:36:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:36:38,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 08:36:38,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143585434] [2023-05-04 08:36:38,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143585434] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 08:36:38,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652946950] [2023-05-04 08:36:38,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 08:36:38,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 08:36:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 08:36:38,073 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 08:36:38,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-05-04 08:36:38,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 08:36:38,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 08:36:38,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 41 conjunts are in the unsatisfiable core [2023-05-04 08:36:38,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 08:36:38,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 08:36:38,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 08:36:38,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 08:36:38,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:38,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 08:36:38,874 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 24 treesize of output 17 [2023-05-04 08:36:38,976 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 28 treesize of output 28 [2023-05-04 08:36:39,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-05-04 08:36:39,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-05-04 08:36:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 08:36:39,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 08:36:49,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:36:51,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:36:53,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|)))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:26,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~post37#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:26,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~mem36#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:26,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:26,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:26,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_987 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_987))) (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (let ((.cse1 (select .cse3 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store .cse2 |c_~#a~0.base| (store .cse3 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1)))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:28,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_987 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_991 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_987))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (let ((.cse2 (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse2)))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 08:37:29,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 08:37:29,263 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 44 treesize of output 47 [2023-05-04 08:37:29,268 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 97 treesize of output 93 [2023-05-04 08:37:29,330 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 08:37:29,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 08:37:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 20 not checked. [2023-05-04 08:37:29,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652946950] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 08:37:29,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 08:37:29,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 19] total 53 [2023-05-04 08:37:29,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261804599] [2023-05-04 08:37:29,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 08:37:29,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-05-04 08:37:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 08:37:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-05-04 08:37:29,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1695, Unknown=33, NotChecked=828, Total=2756 [2023-05-04 08:37:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:37:29,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 08:37:29,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.6415094339622645) internal successors, (352), 53 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-05-04 08:37:29,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 08:37:53,734 WARN L233 SmtUtils]: Spent 24.27s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 08:38:26,127 WARN L233 SmtUtils]: Spent 32.34s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 08:39:18,097 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 08:39:18,097 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 08:39:18,138 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 08:39:18,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 08:39:18,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 08:39:19,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2023-05-04 08:39:19,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2023-05-04 08:39:19,190 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-04 08:39:19,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-05-04 08:39:19,298 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-05-04 08:39:19,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-05-04 08:39:19,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-05-04 08:39:19,335 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:154) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-04 08:39:19,338 INFO L158 Benchmark]: Toolchain (without parser) took 840073.15ms. Allocated memory was 226.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 198.1MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-05-04 08:39:19,338 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 179.3MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 08:39:19,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.81ms. Allocated memory is still 226.5MB. Free memory was 197.6MB in the beginning and 176.1MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-04 08:39:19,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.69ms. Allocated memory is still 226.5MB. Free memory was 176.1MB in the beginning and 173.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 08:39:19,338 INFO L158 Benchmark]: Boogie Preprocessor took 64.01ms. Allocated memory is still 226.5MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 08:39:19,339 INFO L158 Benchmark]: RCFGBuilder took 597.66ms. Allocated memory is still 226.5MB. Free memory was 171.4MB in the beginning and 152.5MB in the end (delta: 18.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-05-04 08:39:19,339 INFO L158 Benchmark]: TraceAbstraction took 838727.98ms. Allocated memory was 226.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 151.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-05-04 08:39:19,340 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.16ms. Allocated memory is still 179.3MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 593.81ms. Allocated memory is still 226.5MB. Free memory was 197.6MB in the beginning and 176.1MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.69ms. Allocated memory is still 226.5MB. Free memory was 176.1MB in the beginning and 173.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.01ms. Allocated memory is still 226.5MB. Free memory was 173.5MB in the beginning and 171.4MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 597.66ms. Allocated memory is still 226.5MB. Free memory was 171.4MB in the beginning and 152.5MB in the end (delta: 18.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 838727.98ms. Allocated memory was 226.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 151.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11357, independent: 10926, independent conditional: 672, independent unconditional: 10254, dependent: 431, dependent conditional: 369, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10995, independent: 10926, independent conditional: 672, independent unconditional: 10254, dependent: 69, dependent conditional: 7, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10995, independent: 10926, independent conditional: 672, independent unconditional: 10254, dependent: 69, dependent conditional: 7, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11011, independent: 10926, independent conditional: 4, independent unconditional: 10922, dependent: 85, dependent conditional: 12, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11011, independent: 10926, independent conditional: 4, independent unconditional: 10922, dependent: 85, dependent conditional: 6, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11011, independent: 10926, independent conditional: 4, independent unconditional: 10922, dependent: 85, dependent conditional: 6, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7721, independent: 7653, independent conditional: 3, independent unconditional: 7650, dependent: 68, dependent conditional: 6, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7721, independent: 7621, independent conditional: 0, independent unconditional: 7621, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 68, dependent conditional: 6, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 68, dependent conditional: 6, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 252, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 166, dependent conditional: 13, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11011, independent: 3273, independent conditional: 1, independent unconditional: 3272, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 7721, unknown conditional: 9, unknown unconditional: 7712] , Statistics on independence cache: Total cache size (in pairs): 7721, Positive cache size: 7653, Positive conditional cache size: 3, Positive unconditional cache size: 7650, Negative cache size: 68, Negative conditional cache size: 6, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2, Independence queries for same thread: 362 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 386, Number of trivial persistent sets: 321, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10316, independent: 10254, independent conditional: 0, independent unconditional: 10254, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11357, independent: 10926, independent conditional: 672, independent unconditional: 10254, dependent: 431, dependent conditional: 369, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10995, independent: 10926, independent conditional: 672, independent unconditional: 10254, dependent: 69, dependent conditional: 7, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10995, independent: 10926, independent conditional: 672, independent unconditional: 10254, dependent: 69, dependent conditional: 7, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11011, independent: 10926, independent conditional: 4, independent unconditional: 10922, dependent: 85, dependent conditional: 12, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11011, independent: 10926, independent conditional: 4, independent unconditional: 10922, dependent: 85, dependent conditional: 6, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11011, independent: 10926, independent conditional: 4, independent unconditional: 10922, dependent: 85, dependent conditional: 6, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7721, independent: 7653, independent conditional: 3, independent unconditional: 7650, dependent: 68, dependent conditional: 6, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7721, independent: 7621, independent conditional: 0, independent unconditional: 7621, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 100, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 68, dependent conditional: 6, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 68, dependent conditional: 6, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 252, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 166, dependent conditional: 13, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11011, independent: 3273, independent conditional: 1, independent unconditional: 3272, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 7721, unknown conditional: 9, unknown unconditional: 7712] , Statistics on independence cache: Total cache size (in pairs): 7721, Positive cache size: 7653, Positive conditional cache size: 3, Positive unconditional cache size: 7650, Negative cache size: 68, Negative conditional cache size: 6, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2, Independence queries for same thread: 362 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2949, independent: 2840, independent conditional: 123, independent unconditional: 2717, dependent: 109, dependent conditional: 99, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 123, independent unconditional: 2717, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 123, independent unconditional: 2717, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2648, independent: 2638, independent conditional: 0, independent unconditional: 2638, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2648, independent: 2627, independent conditional: 0, independent unconditional: 2627, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2850, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2648, unknown conditional: 0, unknown unconditional: 2648] , Statistics on independence cache: Total cache size (in pairs): 2648, Positive cache size: 2638, Positive conditional cache size: 0, Positive unconditional cache size: 2638, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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: 99 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 93, Number of trivial persistent sets: 93, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2727, independent: 2717, independent conditional: 0, independent unconditional: 2717, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2949, independent: 2840, independent conditional: 123, independent unconditional: 2717, dependent: 109, dependent conditional: 99, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 123, independent unconditional: 2717, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 123, independent unconditional: 2717, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2850, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2648, independent: 2638, independent conditional: 0, independent unconditional: 2638, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2648, independent: 2627, independent conditional: 0, independent unconditional: 2627, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2850, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2648, unknown conditional: 0, unknown unconditional: 2648] , Statistics on independence cache: Total cache size (in pairs): 2648, Positive cache size: 2638, Positive conditional cache size: 0, Positive unconditional cache size: 2638, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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: 99 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown