/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 17:27:11,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 17:27:11,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 17:27:11,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 17:27:11,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 17:27:11,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 17:27:11,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 17:27:11,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 17:27:11,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 17:27:11,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 17:27:11,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 17:27:11,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 17:27:11,997 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 17:27:11,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 17:27:11,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 17:27:11,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 17:27:11,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 17:27:11,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 17:27:11,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 17:27:11,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 17:27:12,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 17:27:12,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 17:27:12,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 17:27:12,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 17:27:12,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 17:27:12,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 17:27:12,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 17:27:12,001 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 17:27:12,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 17:27:12,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 17:27:12,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 17:27:12,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 17:27:12,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 17:27:12,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 17:27:12,003 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 17:27:12,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 17:27:12,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 17:27:12,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 17:27:12,003 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 17:27:12,003 INFO L153 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/UGemCutter-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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 17:27:12,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 17:27:12,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 17:27:12,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 17:27:12,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 17:27:12,242 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 17:27:12,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-07 17:27:13,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 17:27:13,553 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 17:27:13,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-07 17:27:13,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c2a35f966/24d4f6c63a3c42a6ba26b8d9760e6253/FLAGc0dc088b5 [2024-05-07 17:27:13,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c2a35f966/24d4f6c63a3c42a6ba26b8d9760e6253 [2024-05-07 17:27:13,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 17:27:13,598 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 17:27:13,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 17:27:13,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 17:27:13,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 17:27:13,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 05:27:13" (1/1) ... [2024-05-07 17:27:13,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92d6917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:13, skipping insertion in model container [2024-05-07 17:27:13,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 05:27:13" (1/1) ... [2024-05-07 17:27:13,656 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 17:27:13,993 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2024-05-07 17:27:13,998 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2024-05-07 17:27:14,001 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2024-05-07 17:27:14,060 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2024-05-07 17:27:14,062 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2024-05-07 17:27:14,064 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2024-05-07 17:27:14,065 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2024-05-07 17:27:14,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 17:27:14,080 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 17:27:14,111 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2024-05-07 17:27:14,112 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2024-05-07 17:27:14,115 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2024-05-07 17:27:14,131 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2024-05-07 17:27:14,134 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2024-05-07 17:27:14,135 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2024-05-07 17:27:14,135 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2024-05-07 17:27:14,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 17:27:14,198 INFO L206 MainTranslator]: Completed translation [2024-05-07 17:27:14,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14 WrapperNode [2024-05-07 17:27:14,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 17:27:14,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 17:27:14,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 17:27:14,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 17:27:14,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,260 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 211 [2024-05-07 17:27:14,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 17:27:14,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 17:27:14,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 17:27:14,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 17:27:14,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 17:27:14,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 17:27:14,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 17:27:14,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 17:27:14,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (1/1) ... [2024-05-07 17:27:14,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 17:27:14,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 17:27:14,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 17:27:14,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 17:27:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2024-05-07 17:27:14,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2024-05-07 17:27:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2024-05-07 17:27:14,380 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2024-05-07 17:27:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 17:27:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 17:27:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 17:27:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 17:27:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 17:27:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 17:27:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 17:27:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 17:27:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 17:27:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 17:27:14,383 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 17:27:14,517 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 17:27:14,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 17:27:14,845 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 17:27:14,866 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 17:27:14,870 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-07 17:27:14,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:14 BoogieIcfgContainer [2024-05-07 17:27:14,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 17:27:14,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 17:27:14,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 17:27:14,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 17:27:14,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 05:27:13" (1/3) ... [2024-05-07 17:27:14,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36efa6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:14, skipping insertion in model container [2024-05-07 17:27:14,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 05:27:14" (2/3) ... [2024-05-07 17:27:14,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36efa6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:14, skipping insertion in model container [2024-05-07 17:27:14,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:14" (3/3) ... [2024-05-07 17:27:14,879 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2024-05-07 17:27:14,885 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 17:27:14,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 17:27:14,898 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-07 17:27:14,899 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 17:27:14,987 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 17:27:15,024 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 17:27:15,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 17:27:15,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 17:27:15,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 17:27:15,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 17:27:15,056 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 17:27:15,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 17:27:15,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 17:27:15,072 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=LoopHeads, 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;@5aa23ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-07 17:27:15,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-05-07 17:27:15,630 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 23 [2024-05-07 17:27:15,651 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 25 [2024-05-07 17:27:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash -595443532, now seen corresponding path program 1 times [2024-05-07 17:27:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 17:27:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 17:27:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 17:27:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 17:27:17,004 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 29 [2024-05-07 17:27:17,071 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1696175707, now seen corresponding path program 1 times [2024-05-07 17:27:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:17,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 17:27:17,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 17:27:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash 538585321, now seen corresponding path program 1 times [2024-05-07 17:27:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 17:27:17,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124940585] [2024-05-07 17:27:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:17,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 17:27:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 17:27:18,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124940585] [2024-05-07 17:27:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124940585] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 17:27:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 17:27:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-07 17:27:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443622536] [2024-05-07 17:27:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 17:27:18,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-07 17:27:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 17:27:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-07 17:27:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-05-07 17:27:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 17:27:18,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 17:27:18,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 17:27:18,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 17:27:20,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:20,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:20,181 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:20,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:20,208 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:20,318 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:20,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -330340134, now seen corresponding path program 1 times [2024-05-07 17:27:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 17:27:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 17:27:23,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:23,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:23,499 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:23,500 INFO L378 Elim1Store]: Elim1 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 9 [2024-05-07 17:27:23,519 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:23,608 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:23,608 INFO L378 Elim1Store]: Elim1 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 9 [2024-05-07 17:27:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1970970037, now seen corresponding path program 2 times [2024-05-07 17:27:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 17:27:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 17:27:26,862 INFO L349 Elim1Store]: treesize reduction 80, result has 67.9 percent of original size [2024-05-07 17:27:26,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 6 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 49 case distinctions, treesize of input 93 treesize of output 217 [2024-05-07 17:27:27,628 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:27,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:27,640 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:28,145 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:28,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:28,154 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1686041095, now seen corresponding path program 1 times [2024-05-07 17:27:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 17:27:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 17:27:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 17:27:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-05-07 17:27:30,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:31,112 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:31,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:31,134 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:31,286 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:31,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:31,303 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1783079711, now seen corresponding path program 1 times [2024-05-07 17:27:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 17:27:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 17:27:31,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:32,022 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:32,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:32,055 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:32,191 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:32,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1836429819, now seen corresponding path program 2 times [2024-05-07 17:27:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 17:27:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 17:27:32,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:32,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:32,976 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:33,036 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:33,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:33,153 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:33,206 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:33,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1691096009, now seen corresponding path program 3 times [2024-05-07 17:27:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-05-07 17:27:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-05-07 17:27:36,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:36,862 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:37,216 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:37,262 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:37,265 INFO L378 Elim1Store]: Elim1 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 9 [2024-05-07 17:27:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash -343782828, now seen corresponding path program 2 times [2024-05-07 17:27:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:38,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:38,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:38,405 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:38,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:38,471 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:38,606 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:38,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:27:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2037753639, now seen corresponding path program 1 times [2024-05-07 17:27:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-07 17:27:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-07 17:27:41,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:41,731 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:41,987 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:41,987 INFO L378 Elim1Store]: Elim1 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 9 [2024-05-07 17:27:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1809098931, now seen corresponding path program 2 times [2024-05-07 17:27:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:42,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:42,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 29 [2024-05-07 17:27:42,916 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:43,107 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:43,108 INFO L378 Elim1Store]: Elim1 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 9 [2024-05-07 17:27:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1518775085, now seen corresponding path program 1 times [2024-05-07 17:27:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-07 17:27:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-07 17:27:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-07 17:27:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-07 17:27:48,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:48,675 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash -248295517, now seen corresponding path program 4 times [2024-05-07 17:27:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:49,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:49,781 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 466839077, now seen corresponding path program 5 times [2024-05-07 17:27:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:50,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 27 [2024-05-07 17:27:50,466 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 17:27:50,466 INFO L378 Elim1Store]: Elim1 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 9 [2024-05-07 17:27:50,534 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:27:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash -452803992, now seen corresponding path program 6 times [2024-05-07 17:27:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:27:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 17:27:51,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 17:27:51,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 17:27:51,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 17:27:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 388017180, now seen corresponding path program 1 times [2024-05-07 17:27:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 17:27:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274107227] [2024-05-07 17:27:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:27:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 17:27:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 17:27:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274107227] [2024-05-07 17:27:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274107227] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 17:27:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445622630] [2024-05-07 17:27:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:27:52,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 17:27:52,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 17:27:52,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 17:27:52,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 17:27:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:27:53,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-07 17:27:53,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 17:27:53,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-05-07 17:27:53,098 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-07 17:27:53,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-05-07 17:27:53,157 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-07 17:27:53,157 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 18 [2024-05-07 17:27:53,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2024-05-07 17:27:53,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-05-07 17:27:53,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-07 17:27:53,544 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 16 [2024-05-07 17:27:54,054 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-05-07 17:27:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2024-05-07 17:27:54,321 INFO L378 Elim1Store]: Elim1 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 89 treesize of output 71 [2024-05-07 17:27:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 97 [2024-05-07 17:27:54,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2024-05-07 17:27:54,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2024-05-07 17:27:54,974 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-05-07 17:27:54,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 55 [2024-05-07 17:27:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 17:27:55,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 17:27:58,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20))) (let ((.cse0 (let ((.cse7 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|))) (store .cse7 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse7 .cse1) 4) 4) 1)))) (and (forall ((v_ArrVal_1523 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1523 .cse1))) (or (not (= v_ArrVal_1523 (store .cse0 .cse1 .cse2))) (< .cse2 1) (= 4 .cse2) (< 0 (let ((.cse3 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* 4 (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))) (< 4 .cse2)))) (forall ((v_ArrVal_1523 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1523 .cse1))) (or (< (+ 3 .cse4) 0) (not (= v_ArrVal_1523 (store .cse0 .cse1 .cse4))) (< 0 (let ((.cse5 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse5 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* 4 (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))) (< 0 .cse4)))) (<= 1 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse0 .cse1 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) is different from false [2024-05-07 17:28:00,915 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521)) (.cse2 (select v_ArrVal_1523 .cse4))) (or (< 0 (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< 0 .cse2) (not (= v_ArrVal_1523 (store (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 .cse4) 4) 4) 1)) .cse4 .cse2))) (< (+ .cse2 3) 0)))) (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521)) (.cse7 (select v_ArrVal_1523 .cse4))) (or (< 0 (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse5 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (= .cse7 4) (< .cse7 1) (< 4 .cse7) (not (= v_ArrVal_1523 (store (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse8 .cse4) 4) 4) 1)) .cse4 .cse7)))))) (forall ((v_ArrVal_1521 (Array Int Int))) (<= 1 (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521))) (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 .cse4) 4) 4) 1)) .cse4 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) is different from false [2024-05-07 17:28:01,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1521 (Array Int Int))) (<= 1 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse3) 4) 4) 1)) .cse3 0))) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse0 (+ (* 4 (select .cse0 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))))) (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521)) (.cse4 (select v_ArrVal_1523 .cse3))) (or (= .cse4 4) (< .cse4 1) (< 4 .cse4) (< 0 (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse5 (+ (* 4 (select .cse5 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (not (= v_ArrVal_1523 (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse7 .cse3) 4) 4) 1)) .cse3 .cse4)))))) (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521)) (.cse8 (select v_ArrVal_1523 .cse3))) (or (< 0 .cse8) (< 0 (let ((.cse9 (select (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse9 (+ (* 4 (select .cse9 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (not (= v_ArrVal_1523 (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 .cse3) 4) 4) 1)) .cse3 .cse8))) (< (+ .cse8 3) 0)))))) is different from false [2024-05-07 17:28:01,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521)) (.cse0 (select v_ArrVal_1523 .cse2))) (or (< 0 .cse0) (not (= v_ArrVal_1523 (store (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 .cse2) 4) 4) 1)) .cse2 .cse0))) (< 0 (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse4 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4)))) (< (+ .cse0 3) 0)))) (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1521 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1523 .cse2)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521))) (or (= .cse5 4) (< .cse5 1) (< 4 .cse5) (not (= v_ArrVal_1523 (store (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 .cse2) 4) 4) 1)) .cse2 .cse5))) (< 0 (let ((.cse8 (select (store .cse7 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1523) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse8 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse8 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4))))))) (forall ((v_ArrVal_1521 (Array Int Int))) (<= 1 (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521))) (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 .cse2) 4) 4) 1)) .cse2 0))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse9 (+ (* (select .cse9 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4))))))) is different from false [2024-05-07 17:28:01,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1521 (Array Int Int))) (<= 1 (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) 1)))) (select (store .cse0 .cse1 0) (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))))) (forall ((v_ArrVal_1521 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 4) (< 4 v_DerPreprocessor_2) (< 0 (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 .cse1) 4) 4) 1)))) (select (store .cse3 .cse1 v_DerPreprocessor_2) (+ (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))) (< v_DerPreprocessor_2 1))) (forall ((v_ArrVal_1521 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< 0 (let ((.cse5 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 .cse1) 4) 4) 1)))) (select (store .cse5 .cse1 v_DerPreprocessor_3) (+ (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))) (< (+ 3 v_DerPreprocessor_3) 0) (< 0 v_DerPreprocessor_3))))) is different from false [2024-05-07 17:28:03,671 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< (+ 3 v_DerPreprocessor_3) 0) (< 0 v_DerPreprocessor_3) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))))) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int))) (<= 1 (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 .cse1) 4) 4) 1)))) (select (store .cse3 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 4) (< 0 (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 .cse1) 4) 4) 1)))) (select (store .cse5 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< 4 v_DerPreprocessor_2) (< v_DerPreprocessor_2 1))))) is different from false [2024-05-07 17:28:03,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)))) (and (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< (+ 3 v_DerPreprocessor_3) 0) (< 0 v_DerPreprocessor_3) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_3) (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))))) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int))) (<= 1 (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 .cse1) 4) 4) 1)))) (select (store .cse4 .cse1 0) (+ (* (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))))) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (= v_DerPreprocessor_2 4) (< 4 v_DerPreprocessor_2) (< 0 (let ((.cse6 (let ((.cse7 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse7 .cse1) 4) 4) 1)))) (select (store .cse6 .cse1 v_DerPreprocessor_2) (+ (* (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))) (< v_DerPreprocessor_2 1))))) is different from false [2024-05-07 17:28:03,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 17:28:03,978 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 125 treesize of output 92 [2024-05-07 17:28:03,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 17:28:03,988 INFO L378 Elim1Store]: Elim1 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 220 treesize of output 216 [2024-05-07 17:28:04,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 17:28:04,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 567 treesize of output 383 [2024-05-07 17:28:04,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 17:28:04,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 497 treesize of output 372 [2024-05-07 17:28:04,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-05-07 17:28:04,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 17:28:04,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 587 treesize of output 470 [2024-05-07 17:28:06,527 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 17:28:06,530 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 17:28:06,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 1 [2024-05-07 17:28:06,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-07 17:28:06,559 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-07 17:28:06,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 1 [2024-05-07 17:28:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 17:28:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445622630] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 17:28:07,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 17:28:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33, 32] total 75 [2024-05-07 17:28:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517116266] [2024-05-07 17:28:07,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 17:28:07,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-05-07 17:28:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 17:28:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-05-07 17:28:07,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4303, Unknown=40, NotChecked=966, Total=5550 [2024-05-07 17:28:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 17:28:07,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 17:28:07,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.973333333333333) internal successors, (298), 75 states have internal predecessors, (298), 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) [2024-05-07 17:28:07,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-07 17:28:07,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 17:28:15,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-05-07 17:28:15,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:28:16,010 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:28:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -343782828, now seen corresponding path program 3 times [2024-05-07 17:28:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:28:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:28:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:28:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:28:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:28:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:28:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:28:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 17:28:21,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 17:28:21,366 INFO L349 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2024-05-07 17:28:21,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 64 [2024-05-07 17:28:23,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-07 17:28:23,532 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-05-07 17:28:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash -196872827, now seen corresponding path program 1 times [2024-05-07 17:28:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:28:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:28:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 17:28:23,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 17:28:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 17:28:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-07 17:28:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-07 17:28:24,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-07 17:28:24,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34 [2024-05-07 17:28:24,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-07 17:28:24,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 17:28:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1810537846, now seen corresponding path program 1 times [2024-05-07 17:28:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 17:28:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465677390] [2024-05-07 17:28:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:28:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 17:28:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:28:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 59 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 17:28:28,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 17:28:28,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465677390] [2024-05-07 17:28:28,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465677390] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 17:28:28,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993927271] [2024-05-07 17:28:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 17:28:28,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 17:28:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 17:28:28,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 17:28:28,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 17:28:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 17:28:28,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 148 conjunts are in the unsatisfiable core [2024-05-07 17:28:28,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 17:28:29,920 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-05-07 17:28:31,703 INFO L349 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2024-05-07 17:28:31,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 105 [2024-05-07 17:28:32,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 180 [2024-05-07 17:28:32,384 INFO L349 Elim1Store]: treesize reduction 47, result has 27.7 percent of original size [2024-05-07 17:28:32,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 179 [2024-05-07 17:28:32,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 17:28:32,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 17:28:32,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-05-07 17:28:36,123 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-05-07 17:28:36,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66 [2024-05-07 17:28:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 17:28:36,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 17:29:23,128 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-05-07 17:29:23,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56936 treesize of output 52424 [2024-05-07 17:30:08,168 WARN L293 SmtUtils]: Spent 43.60s on a formula simplification. DAG size of input: 594 DAG size of output: 556 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-05-07 17:30:08,168 INFO L349 Elim1Store]: treesize reduction 107, result has 92.6 percent of original size [2024-05-07 17:30:08,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 20 new quantified variables, introduced 136 case distinctions, treesize of input 29205307 treesize of output 23736308 [2024-05-07 17:41:07,785 WARN L293 SmtUtils]: Spent 10.99m on a formula simplification. DAG size of input: 6726 DAG size of output: 3706 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2024-05-07 17:41:27,261 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 17:41:27,261 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 17:41:27,263 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-05-07 17:41:27,267 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-05-07 17:41:27,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 17:41:27,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-05-07 17:41:27,468 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2024-05-07 17:41:27,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-05-07 17:41:27,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-05-07 17:41:27,473 INFO L448 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 17:41:27,477 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 17:41:27,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 17:41:27,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:41:27 BasicIcfg [2024-05-07 17:41:27,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 17:41:27,481 INFO L158 Benchmark]: Toolchain (without parser) took 853883.60ms. Allocated memory was 217.1MB in the beginning and 1.2GB in the end (delta: 999.3MB). Free memory was 145.7MB in the beginning and 964.7MB in the end (delta: -819.0MB). Peak memory consumption was 778.4MB. Max. memory is 8.0GB. [2024-05-07 17:41:27,481 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 217.1MB. Free memory is still 181.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 17:41:27,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.40ms. Allocated memory was 217.1MB in the beginning and 269.5MB in the end (delta: 52.4MB). Free memory was 145.5MB in the beginning and 207.9MB in the end (delta: -62.4MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2024-05-07 17:41:27,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.07ms. Allocated memory is still 269.5MB. Free memory was 207.9MB in the beginning and 204.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 17:41:27,482 INFO L158 Benchmark]: Boogie Preprocessor took 41.97ms. Allocated memory is still 269.5MB. Free memory was 204.8MB in the beginning and 202.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 17:41:27,482 INFO L158 Benchmark]: RCFGBuilder took 568.26ms. Allocated memory is still 269.5MB. Free memory was 202.7MB in the beginning and 177.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-07 17:41:27,482 INFO L158 Benchmark]: TraceAbstraction took 852607.43ms. Allocated memory was 269.5MB in the beginning and 1.2GB in the end (delta: 946.9MB). Free memory was 175.9MB in the beginning and 964.7MB in the end (delta: -788.7MB). Peak memory consumption was 755.4MB. Max. memory is 8.0GB. [2024-05-07 17:41:27,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 217.1MB. Free memory is still 181.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 600.40ms. Allocated memory was 217.1MB in the beginning and 269.5MB in the end (delta: 52.4MB). Free memory was 145.5MB in the beginning and 207.9MB in the end (delta: -62.4MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.07ms. Allocated memory is still 269.5MB. Free memory was 207.9MB in the beginning and 204.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.97ms. Allocated memory is still 269.5MB. Free memory was 204.8MB in the beginning and 202.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 568.26ms. Allocated memory is still 269.5MB. Free memory was 202.7MB in the beginning and 177.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 852607.43ms. Allocated memory was 269.5MB in the beginning and 1.2GB in the end (delta: 946.9MB). Free memory was 175.9MB in the beginning and 964.7MB in the end (delta: -788.7MB). Peak memory consumption was 755.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 398697, independent: 388782, independent conditional: 385688, independent unconditional: 3094, dependent: 9915, dependent conditional: 9908, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 389302, independent: 388782, independent conditional: 385688, independent unconditional: 3094, dependent: 520, dependent conditional: 513, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 389302, independent: 388782, independent conditional: 385688, independent unconditional: 3094, dependent: 520, dependent conditional: 513, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 389302, independent: 388782, independent conditional: 385688, independent unconditional: 3094, dependent: 520, dependent conditional: 513, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 391065, independent: 388782, independent conditional: 180783, independent unconditional: 207999, dependent: 2283, dependent conditional: 1559, dependent unconditional: 724, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 391065, independent: 388782, independent conditional: 49959, independent unconditional: 338823, dependent: 2283, dependent conditional: 866, dependent unconditional: 1417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 391065, independent: 388782, independent conditional: 49959, independent unconditional: 338823, dependent: 2283, dependent conditional: 866, dependent unconditional: 1417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4034, independent: 3973, independent conditional: 373, independent unconditional: 3600, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4034, independent: 3967, independent conditional: 0, independent unconditional: 3967, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, independent: 11, independent conditional: 3, independent unconditional: 8, dependent: 163, dependent conditional: 82, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 391065, independent: 384809, independent conditional: 49586, independent unconditional: 335223, dependent: 2222, dependent conditional: 829, dependent unconditional: 1393, unknown: 4034, unknown conditional: 410, unknown unconditional: 3624] , Statistics on independence cache: Total cache size (in pairs): 4034, Positive cache size: 3973, Positive conditional cache size: 373, Positive unconditional cache size: 3600, Negative cache size: 61, Negative conditional cache size: 37, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 131517, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 391065, independent: 388782, independent conditional: 180783, independent unconditional: 207999, dependent: 2283, dependent conditional: 1559, dependent unconditional: 724, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 391065, independent: 388782, independent conditional: 49959, independent unconditional: 338823, dependent: 2283, dependent conditional: 866, dependent unconditional: 1417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 391065, independent: 388782, independent conditional: 49959, independent unconditional: 338823, dependent: 2283, dependent conditional: 866, dependent unconditional: 1417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4034, independent: 3973, independent conditional: 373, independent unconditional: 3600, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4034, independent: 3967, independent conditional: 0, independent unconditional: 3967, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, independent: 11, independent conditional: 3, independent unconditional: 8, dependent: 163, dependent conditional: 82, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 391065, independent: 384809, independent conditional: 49586, independent unconditional: 335223, dependent: 2222, dependent conditional: 829, dependent unconditional: 1393, unknown: 4034, unknown conditional: 410, unknown unconditional: 3624] , Statistics on independence cache: Total cache size (in pairs): 4034, Positive cache size: 3973, Positive conditional cache size: 373, Positive unconditional cache size: 3600, Negative cache size: 61, Negative conditional cache size: 37, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 131517 ], Independence queries for same thread: 9395 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 214 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-4-11-2-2-2-2-2-2-2-2-2-2-2-2-5-3-3-3-3-4-4-4-4-4-4-4-3-4-3-4-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-165-11-4-4-4-3-4-3-4-3-4-3-4-3-5-3-4-3-4-4-4-4-4-4-4-4-3-4-3-4-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 338 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 852.4s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 52.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 507 ConstructedInterpolants, 77 QuantifiedInterpolants, 23647 SizeOfPredicates, 46 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 35.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 23, ConditionalCommutativityTraceChecks: 17, ConditionalCommutativityImperfectProofs: 13 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown