/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR --traceabstraction.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 10:24:10,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 10:24:10,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-08 10:24:10,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 10:24:10,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 10:24:10,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 10:24:10,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 10:24:10,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 10:24:10,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 10:24:10,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 10:24:10,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 10:24:10,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 10:24:10,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 10:24:10,443 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 10:24:10,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 10:24:10,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 10:24:10,444 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 10:24:10,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 10:24:10,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 10:24:10,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 10:24:10,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 10:24:10,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 10:24:10,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 10:24:10,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 10:24:10,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 10:24:10,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 10:24:10,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 10:24:10,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 10:24:10,447 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 10:24:10,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 10:24:10,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 10:24:10,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 10:24:10,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 10:24:10,449 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-08 10:24:10,449 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2023-09-08 10:24:10,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 10:24:10,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 10:24:10,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 10:24:10,668 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 10:24:10,668 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 10:24:10,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-09-08 10:24:11,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 10:24:11,837 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 10:24:11,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-09-08 10:24:11,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6c31eda/e25dc02f75784d97ace38a92b2751a4b/FLAGb4ec6afe1 [2023-09-08 10:24:11,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6c31eda/e25dc02f75784d97ace38a92b2751a4b [2023-09-08 10:24:11,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 10:24:11,870 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 10:24:11,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 10:24:11,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 10:24:11,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 10:24:11,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:24:11" (1/1) ... [2023-09-08 10:24:11,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463b105e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:11, skipping insertion in model container [2023-09-08 10:24:11,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:24:11" (1/1) ... [2023-09-08 10:24:11,915 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 10:24:12,265 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/queue_longest.i[43296,43309] [2023-09-08 10:24:12,272 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/queue_longest.i[43503,43516] [2023-09-08 10:24:12,276 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/queue_longest.i[43783,43796] [2023-09-08 10:24:12,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 10:24:12,292 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 10:24:12,315 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 10:24:12,317 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 10:24:12,327 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-08 10:24:12,343 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/queue_longest.i[43296,43309] [2023-09-08 10:24:12,344 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/queue_longest.i[43503,43516] [2023-09-08 10:24:12,348 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/queue_longest.i[43783,43796] [2023-09-08 10:24:12,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 10:24:12,416 INFO L206 MainTranslator]: Completed translation [2023-09-08 10:24:12,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12 WrapperNode [2023-09-08 10:24:12,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 10:24:12,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 10:24:12,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 10:24:12,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 10:24:12,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,479 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-09-08 10:24:12,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 10:24:12,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 10:24:12,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 10:24:12,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 10:24:12,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 10:24:12,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 10:24:12,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 10:24:12,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 10:24:12,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (1/1) ... [2023-09-08 10:24:12,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 10:24:12,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 10:24:12,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-08 10:24:12,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-08 10:24:12,615 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-08 10:24:12,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-08 10:24:12,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 10:24:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 10:24:12,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 10:24:12,617 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 10:24:12,747 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 10:24:12,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 10:24:13,046 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 10:24:13,060 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 10:24:13,061 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 10:24:13,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:24:13 BoogieIcfgContainer [2023-09-08 10:24:13,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 10:24:13,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 10:24:13,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 10:24:13,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 10:24:13,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:24:11" (1/3) ... [2023-09-08 10:24:13,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c6f445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:24:13, skipping insertion in model container [2023-09-08 10:24:13,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:24:12" (2/3) ... [2023-09-08 10:24:13,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c6f445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:24:13, skipping insertion in model container [2023-09-08 10:24:13,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:24:13" (3/3) ... [2023-09-08 10:24:13,073 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-09-08 10:24:13,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 10:24:13,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 10:24:13,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-09-08 10:24:13,091 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 10:24:13,212 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 10:24:13,256 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 10:24:13,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 10:24:13,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 10:24:13,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-08 10:24:13,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-08 10:24:13,285 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 10:24:13,290 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-08 10:24:13,291 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-08 10:24:13,291 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-08 10:24:13,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 10:24:13,300 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d5e4d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 10:24:13,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-08 10:24:13,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:13,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-09-08 10:24:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992286735] [2023-09-08 10:24:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992286735] [2023-09-08 10:24:13,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992286735] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:13,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:24:13,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 10:24:13,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411335712] [2023-09-08 10:24:13,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 10:24:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 10:24:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 10:24:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:13,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:13,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:13,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:13,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 10:24:13,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:13,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507384, now seen corresponding path program 1 times [2023-09-08 10:24:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053930985] [2023-09-08 10:24:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053930985] [2023-09-08 10:24:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053930985] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:13,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:24:13,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 10:24:13,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811525905] [2023-09-08 10:24:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:13,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 10:24:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 10:24:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 10:24:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:13,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:13,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:13,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:13,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:14,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 10:24:14,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:14,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236260, now seen corresponding path program 1 times [2023-09-08 10:24:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805004433] [2023-09-08 10:24:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805004433] [2023-09-08 10:24:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805004433] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:24:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-09-08 10:24:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843129726] [2023-09-08 10:24:16,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:16,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-08 10:24:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-08 10:24:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-08 10:24:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:16,067 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:16,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:16,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 10:24:16,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:16,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash 934072322, now seen corresponding path program 1 times [2023-09-08 10:24:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:16,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676173091] [2023-09-08 10:24:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:19,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676173091] [2023-09-08 10:24:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676173091] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:24:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-09-08 10:24:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208907710] [2023-09-08 10:24:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:19,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-08 10:24:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-08 10:24:19,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2023-09-08 10:24:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:19,635 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:19,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:22,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-08 10:24:22,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:22,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1713858353, now seen corresponding path program 1 times [2023-09-08 10:24:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590180095] [2023-09-08 10:24:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590180095] [2023-09-08 10:24:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590180095] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:24:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 10:24:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978367429] [2023-09-08 10:24:22,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:22,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 10:24:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 10:24:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 10:24:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:22,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:22,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:22,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:22,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-08 10:24:22,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:22,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1493771274, now seen corresponding path program 1 times [2023-09-08 10:24:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719446525] [2023-09-08 10:24:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-09-08 10:24:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:22,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719446525] [2023-09-08 10:24:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719446525] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:22,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:24:22,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 10:24:22,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863736648] [2023-09-08 10:24:22,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:22,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 10:24:22,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 10:24:22,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 10:24:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:22,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:22,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:22,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:22,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:24:22,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-08 10:24:22,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:22,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 494892714, now seen corresponding path program 2 times [2023-09-08 10:24:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457882624] [2023-09-08 10:24:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:26,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457882624] [2023-09-08 10:24:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457882624] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 10:24:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904023382] [2023-09-08 10:24:26,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 10:24:26,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 10:24:26,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 10:24:26,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 10:24:26,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-08 10:24:27,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 10:24:27,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 10:24:27,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2023-09-08 10:24:27,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 10:24:27,326 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 10:24:27,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 10:24:27,394 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-08 10:24:27,394 INFO L351 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 11 treesize of output 11 [2023-09-08 10:24:27,602 INFO L351 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 11 treesize of output 7 [2023-09-08 10:24:27,671 INFO L351 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 19 treesize of output 18 [2023-09-08 10:24:28,262 INFO L351 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 21 treesize of output 21 [2023-09-08 10:24:28,387 INFO L351 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 21 treesize of output 21 [2023-09-08 10:24:28,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:28,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:28,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 30 [2023-09-08 10:24:28,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2023-09-08 10:24:29,076 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-09-08 10:24:29,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:29,185 INFO L351 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 21 treesize of output 21 [2023-09-08 10:24:29,681 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-08 10:24:29,681 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-09-08 10:24:29,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2023-09-08 10:24:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:29,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 10:24:29,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904023382] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:24:29,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 10:24:29,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [44] total 70 [2023-09-08 10:24:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041301720] [2023-09-08 10:24:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:24:29,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-08 10:24:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-08 10:24:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4422, Unknown=0, NotChecked=0, Total=4830 [2023-09-08 10:24:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:29,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:29,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.413793103448276) internal successors, (186), 29 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:29,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:29,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:29,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:29,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:29,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:29,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:24:29,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:24:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:31,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-08 10:24:31,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-09-08 10:24:31,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:24:31,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:24:31,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1882119695, now seen corresponding path program 1 times [2023-09-08 10:24:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:24:31,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515919780] [2023-09-08 10:24:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:31,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:24:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:35,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:24:35,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515919780] [2023-09-08 10:24:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515919780] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 10:24:35,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823698848] [2023-09-08 10:24:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:24:35,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 10:24:35,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 10:24:35,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 10:24:35,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-08 10:24:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:24:35,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 123 conjunts are in the unsatisfiable core [2023-09-08 10:24:35,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 10:24:35,550 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 10:24:35,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 10:24:35,611 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-08 10:24:35,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-08 10:24:35,840 INFO L351 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 11 treesize of output 7 [2023-09-08 10:24:35,916 INFO L351 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 19 treesize of output 18 [2023-09-08 10:24:36,522 INFO L351 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 21 treesize of output 21 [2023-09-08 10:24:36,642 INFO L351 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 21 treesize of output 21 [2023-09-08 10:24:37,092 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-09-08 10:24:37,092 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2023-09-08 10:24:37,357 INFO L322 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2023-09-08 10:24:37,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 61 treesize of output 58 [2023-09-08 10:24:37,621 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-09-08 10:24:37,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:37,756 INFO L351 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 27 treesize of output 22 [2023-09-08 10:24:38,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:38,468 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-09-08 10:24:38,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 49 [2023-09-08 10:24:38,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:38,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 39 [2023-09-08 10:24:38,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:38,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-09-08 10:24:39,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:39,034 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-09-08 10:24:39,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:39,633 INFO L322 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-09-08 10:24:39,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2023-09-08 10:24:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:24:39,859 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-08 10:24:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:40,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 10:24:42,812 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (= (select .cse1 .cse2) 800)))))))) is different from false [2023-09-08 10:24:43,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (= (select .cse1 .cse2) 800)))))) is different from false [2023-09-08 10:24:43,911 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse2))) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse2)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0)))))) is different from false [2023-09-08 10:24:44,132 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse2)) (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|)))))))) is different from false [2023-09-08 10:24:44,281 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= (select .cse1 .cse2) 800)))))) is different from false [2023-09-08 10:24:44,355 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_421) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= (select .cse1 .cse2) 800)))))) is different from false [2023-09-08 10:24:44,535 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse1 v_ArrVal_423)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse2 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (= (select .cse0 .cse1) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)))))))) is different from false [2023-09-08 10:24:47,915 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse2 v_ArrVal_423))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse1 .cse2)))))))) is different from false [2023-09-08 10:24:50,964 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_415 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_415)))) (let ((.cse7 (let ((.cse10 (let ((.cse11 (store (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_421) .cse1 v_ArrVal_423))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_427)))) (let ((.cse4 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434)))) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse4 |c_~#queue~0.base|) .cse2))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse5 .cse1)))))))) is different from false [2023-09-08 10:24:51,659 INFO L322 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-09-08 10:24:51,660 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 2932 treesize of output 2080 [2023-09-08 10:24:52,517 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 10:24:52,518 INFO L351 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 193577 treesize of output 191159 [2023-09-08 10:24:52,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44154 treesize of output 43482 [2023-09-08 10:24:53,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 10:24:53,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11083 treesize of output 11003 [2023-09-08 10:24:53,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 522 treesize of output 490 [2023-09-08 10:24:55,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-09-08 10:24:55,754 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 10:24:55,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 10:24:55,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 10:24:55,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-09-08 10:24:55,914 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 10:24:55,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3596 treesize of output 3550 [2023-09-08 10:24:57,929 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 10:24:57,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 119 [2023-09-08 10:24:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:24:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823698848] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 10:24:58,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 10:24:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 45, 47] total 123 [2023-09-08 10:24:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432630556] [2023-09-08 10:24:58,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 10:24:58,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2023-09-08 10:24:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:24:58,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2023-09-08 10:24:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=954, Invalid=11875, Unknown=89, NotChecked=2088, Total=15006 [2023-09-08 10:24:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:58,309 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:24:58,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 4.357723577235772) internal successors, (536), 123 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:24:58,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:25:09,506 WARN L234 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 139 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 10:25:15,833 WARN L234 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 131 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 10:26:05,019 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse29 (+ 3208 |c_~#queue~0.offset|)) (.cse25 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|))) (let ((.cse2 (select .cse23 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse18 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse22 (select .cse7 .cse8)) (.cse35 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse39 (let ((.cse41 (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse42 |c_~#queue~0.base| (store (store (store (select .cse42 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse29 v_ArrVal_421) .cse25 v_ArrVal_423))))) (store .cse41 |c_~#stored_elements~0.base| (store (select .cse41 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse37 (let ((.cse40 (select .cse39 |c_~#queue~0.base|))) (store .cse40 (+ (* 4 (select .cse40 .cse25)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse36 (let ((.cse38 (store .cse39 |c_~#queue~0.base| (store (store .cse37 .cse29 v_ArrVal_429) .cse25 v_ArrVal_431)))) (store .cse38 |c_~#stored_elements~0.base| (store (select .cse38 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse36 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse36 |c_~#queue~0.base|) .cse4))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse37 .cse25))))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (or (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 3200)) (select .cse0 (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 3204))))) .cse1) (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or .cse1 (not (= .cse2 |c_ULTIMATE.start_empty_#t~mem31#1|))) (<= |c_~#stored_elements~0.base| 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= 5 |c_ULTIMATE.start_init_~q#1.base|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or .cse1 (not (= |c_ULTIMATE.start_empty_#t~mem31#1| |c_ULTIMATE.start_empty_#t~mem32#1|))) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int))) (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_431)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= (select (select .cse3 |c_~#queue~0.base|) .cse4) 800)) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (let ((.cse9 (select (select |c_#memory_int| 5) 3200))) (or (= .cse9 (select (select |c_#memory_int| |c_~#stored_elements~0.base|) 0)) (= .cse9 0))) (= 5 |c_~#queue~0.base|) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse10 (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse14 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse14 .cse11))) v_ArrVal_427)))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_429) .cse11 v_ArrVal_431)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (= 800 (select .cse10 .cse11)) (not (= 800 (select (select .cse12 |c_~#queue~0.base|) .cse4))) (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))))) (= (select |c_#valid| 5) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse16 (store .cse7 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_427))) (let ((.cse15 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse18 v_ArrVal_429) .cse8 v_ArrVal_431)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (= 800 (select .cse16 .cse8)) (not (= 800 (select (select .cse15 |c_~#queue~0.base|) .cse4))))))) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse20 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* .cse22 4)) v_ArrVal_427))) (let ((.cse19 (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 .cse18 v_ArrVal_429) .cse8 v_ArrVal_431)))) (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= (select (select (store .cse19 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= (select (select .cse19 |c_~#queue~0.base|) .cse4) 800)) (= (select .cse20 .cse8) 800))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= |c_~#stored_elements~0.offset| 0) (or .cse1 (not (= .cse2 (select .cse23 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3200))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse28 (let ((.cse31 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse32 |c_~#queue~0.base| (store (store (store (select .cse32 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse29 v_ArrVal_421) .cse25 v_ArrVal_423))))) (store .cse31 |c_~#stored_elements~0.base| (store (select .cse31 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse24 (let ((.cse30 (select .cse28 |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse25) 4)) v_ArrVal_427)))) (let ((.cse26 (let ((.cse27 (store .cse28 |c_~#queue~0.base| (store (store .cse24 .cse29 v_ArrVal_429) .cse25 v_ArrVal_431)))) (store .cse27 |c_~#stored_elements~0.base| (store (select .cse27 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (= 800 (select .cse24 .cse25)) (not (= (select (select (store .cse26 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse26 |c_~#queue~0.base|) .cse4))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0)))))) (or (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int)) (let ((.cse33 (let ((.cse34 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse18 v_ArrVal_429) .cse8 v_ArrVal_431)))) (store .cse34 |c_~#stored_elements~0.base| (store (select .cse34 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= 800 (select (select .cse33 |c_~#queue~0.base|) .cse4))) (not (= (select (select (store .cse33 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))) (= 800 .cse22)) (= 5 |c_ULTIMATE.start_init_#in~q#1.base|) (not (= (select .cse35 3200) 800)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (or (not (= (select .cse35 .cse25) (select .cse35 .cse4))) .cse1)))) is different from true [2023-09-08 10:26:07,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 10:27:10,195 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse28 (+ 3208 |c_~#queue~0.offset|)) (.cse24 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|))) (let ((.cse2 (select .cse22 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (.cse6 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse17 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse21 (select .cse7 .cse8)) (.cse34 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse38 (let ((.cse40 (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse41 |c_~#queue~0.base| (store (store (store (select .cse41 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse28 v_ArrVal_421) .cse24 v_ArrVal_423))))) (store .cse40 |c_~#stored_elements~0.base| (store (select .cse40 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse36 (let ((.cse39 (select .cse38 |c_~#queue~0.base|))) (store .cse39 (+ (* 4 (select .cse39 .cse24)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse35 (let ((.cse37 (store .cse38 |c_~#queue~0.base| (store (store .cse36 .cse28 v_ArrVal_429) .cse24 v_ArrVal_431)))) (store .cse37 |c_~#stored_elements~0.base| (store (select .cse37 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse35 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse35 |c_~#queue~0.base|) .cse4))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse36 .cse24))))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (or (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 3200)) (select .cse0 (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 3204))))) .cse1) (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or .cse1 (not (= .cse2 |c_ULTIMATE.start_empty_#t~mem31#1|))) (<= |c_~#stored_elements~0.base| 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= 5 |c_ULTIMATE.start_init_~q#1.base|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or .cse1 (not (= |c_ULTIMATE.start_empty_#t~mem31#1| |c_ULTIMATE.start_empty_#t~mem32#1|))) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int))) (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_431)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= (select (select .cse3 |c_~#queue~0.base|) .cse4) 800)) (not (= (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= 5 |c_~#queue~0.base|) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse13 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse13 .cse10))) v_ArrVal_427)))) (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_429) .cse10 v_ArrVal_431)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (= 800 (select .cse9 .cse10)) (not (= 800 (select (select .cse11 |c_~#queue~0.base|) .cse4))) (not (= (select (select (store .cse11 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))))) (= (select |c_#valid| 5) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse15 (store .cse7 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_427))) (let ((.cse14 (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse15 .cse17 v_ArrVal_429) .cse8 v_ArrVal_431)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (= 800 (select .cse15 .cse8)) (not (= 800 (select (select .cse14 |c_~#queue~0.base|) .cse4))))))) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse19 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* .cse21 4)) v_ArrVal_427))) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse19 .cse17 v_ArrVal_429) .cse8 v_ArrVal_431)))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= (select (select (store .cse18 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= (select (select .cse18 |c_~#queue~0.base|) .cse4) 800)) (= (select .cse19 .cse8) 800))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= |c_~#stored_elements~0.offset| 0) (or .cse1 (not (= .cse2 (select .cse22 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3200))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse27 (let ((.cse30 (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse31 |c_~#queue~0.base| (store (store (store (select .cse31 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse28 v_ArrVal_421) .cse24 v_ArrVal_423))))) (store .cse30 |c_~#stored_elements~0.base| (store (select .cse30 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse23 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse24) 4)) v_ArrVal_427)))) (let ((.cse25 (let ((.cse26 (store .cse27 |c_~#queue~0.base| (store (store .cse23 .cse28 v_ArrVal_429) .cse24 v_ArrVal_431)))) (store .cse26 |c_~#stored_elements~0.base| (store (select .cse26 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (= 800 (select .cse23 .cse24)) (not (= (select (select (store .cse25 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse25 |c_~#queue~0.base|) .cse4))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0)))))) (or (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int)) (let ((.cse32 (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse17 v_ArrVal_429) .cse8 v_ArrVal_431)))) (store .cse33 |c_~#stored_elements~0.base| (store (select .cse33 |c_~#stored_elements~0.base|) .cse6 v_ArrVal_434))))) (or (not (= 800 (select (select .cse32 |c_~#queue~0.base|) .cse4))) (not (= (select (select (store .cse32 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))) (= 800 .cse21)) (= 5 |c_ULTIMATE.start_init_#in~q#1.base|) (not (= (select .cse34 3200) 800)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (or (not (= (select .cse34 .cse24) (select .cse34 .cse4))) .cse1)))) is different from true [2023-09-08 10:27:25,703 WARN L234 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 236 DAG size of output: 219 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 10:27:53,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:27:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:27:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-09-08 10:27:55,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-08 10:27:55,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 10:27:55,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:27:55,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:27:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1703422451, now seen corresponding path program 1 times [2023-09-08 10:27:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:27:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816317827] [2023-09-08 10:27:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:27:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:27:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:27:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 10:27:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:27:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816317827] [2023-09-08 10:27:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816317827] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 10:27:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 10:27:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 10:27:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137171153] [2023-09-08 10:27:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 10:27:55,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 10:27:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 10:27:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 10:27:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 10:27:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:27:55,372 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 10:27:55,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-09-08 10:27:55,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:29:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-09-08 10:29:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 10:29:01,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-08 10:29:01,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 10:29:01,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 10:29:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1705847134, now seen corresponding path program 1 times [2023-09-08 10:29:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 10:29:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944476413] [2023-09-08 10:29:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:29:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 10:29:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:29:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-08 10:29:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 10:29:06,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944476413] [2023-09-08 10:29:06,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944476413] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 10:29:06,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174609594] [2023-09-08 10:29:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 10:29:06,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 10:29:06,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 10:29:06,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 10:29:06,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-08 10:29:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 10:29:06,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 132 conjunts are in the unsatisfiable core [2023-09-08 10:29:06,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 10:29:06,581 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 10:29:06,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 10:29:06,651 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-08 10:29:06,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-08 10:29:06,884 INFO L351 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 11 treesize of output 7 [2023-09-08 10:29:06,962 INFO L351 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 19 treesize of output 18 [2023-09-08 10:29:07,636 INFO L351 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 21 treesize of output 21 [2023-09-08 10:29:07,759 INFO L351 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 21 treesize of output 21 [2023-09-08 10:29:08,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2023-09-08 10:29:08,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-09-08 10:29:08,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 31 [2023-09-08 10:29:08,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:08,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 35 [2023-09-08 10:29:09,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:09,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-08 10:29:09,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:09,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-08 10:29:09,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:09,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2023-09-08 10:29:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:10,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 35 [2023-09-08 10:29:10,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:10,966 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-09-08 10:29:10,969 INFO L351 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 20 treesize of output 14 [2023-09-08 10:29:11,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 10:29:11,093 INFO L351 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 14 treesize of output 16 [2023-09-08 10:29:11,273 INFO L351 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 15 treesize of output 7 [2023-09-08 10:29:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-08 10:29:11,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 10:29:11,526 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_634) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_634) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2023-09-08 10:29:12,625 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_630)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int)) (let ((.cse7 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_630)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (select .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) 0)))))) is different from false [2023-09-08 10:30:17,856 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ (select .cse10 .cse12) 1))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ (* 4 (select .cse15 .cse1)) |c_~#queue~0.offset|))) 0))))))) is different from false [2023-09-08 10:32:06,302 WARN L234 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 10:32:09,349 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_619) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_619) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|))) 0)))))) is different from false [2023-09-08 10:32:09,995 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_619) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse7))) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_619) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse7))) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* 4 (select .cse14 .cse2)) |c_~#queue~0.offset|))) 0))))))) is different from false [2023-09-08 10:32:22,855 WARN L234 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 10:32:52,045 INFO L322 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-09-08 10:32:52,045 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 6678 treesize of output 3966 [2023-09-08 10:32:52,513 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 10:32:52,514 INFO L351 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 44961 treesize of output 43581 [2023-09-08 10:32:54,089 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 10:32:54,101 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 53853827478 treesize of output 43956167455 Received shutdown request... [2023-09-08 10:38:20,760 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 10:38:20,760 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 10:38:20,760 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 10:38:20,809 WARN L266 SmtUtils]: Removed 1 from assertion stack [2023-09-08 10:38:20,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-08 10:38:20,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-08 10:38:21,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 10:38:21,017 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-73-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. [2023-09-08 10:38:21,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-08 10:38:21,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-08 10:38:21,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-08 10:38:21,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-09-08 10:38:21,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-09-08 10:38:21,019 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-08 10:38:21,023 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 10:38:21,026 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 10:38:21,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 10:38:21,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 10:38:21 BasicIcfg [2023-09-08 10:38:21,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 10:38:21,028 INFO L158 Benchmark]: Toolchain (without parser) took 849158.47ms. Allocated memory was 190.8MB in the beginning and 795.9MB in the end (delta: 605.0MB). Free memory was 131.8MB in the beginning and 540.0MB in the end (delta: -408.2MB). Peak memory consumption was 505.9MB. Max. memory is 7.0GB. [2023-09-08 10:38:21,029 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 190.8MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 10:38:21,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.83ms. Allocated memory was 190.8MB in the beginning and 254.8MB in the end (delta: 64.0MB). Free memory was 131.8MB in the beginning and 211.6MB in the end (delta: -79.8MB). Peak memory consumption was 27.4MB. Max. memory is 7.0GB. [2023-09-08 10:38:21,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.65ms. Allocated memory is still 254.8MB. Free memory was 211.6MB in the beginning and 208.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-08 10:38:21,029 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 254.8MB. Free memory was 208.4MB in the beginning and 206.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 10:38:21,029 INFO L158 Benchmark]: RCFGBuilder took 543.50ms. Allocated memory is still 254.8MB. Free memory was 206.3MB in the beginning and 182.7MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 7.0GB. [2023-09-08 10:38:21,029 INFO L158 Benchmark]: TraceAbstraction took 847961.69ms. Allocated memory was 254.8MB in the beginning and 795.9MB in the end (delta: 541.1MB). Free memory was 182.2MB in the beginning and 540.0MB in the end (delta: -357.8MB). Peak memory consumption was 492.1MB. Max. memory is 7.0GB. [2023-09-08 10:38:21,030 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.23ms. Allocated memory is still 190.8MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 547.83ms. Allocated memory was 190.8MB in the beginning and 254.8MB in the end (delta: 64.0MB). Free memory was 131.8MB in the beginning and 211.6MB in the end (delta: -79.8MB). Peak memory consumption was 27.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 60.65ms. Allocated memory is still 254.8MB. Free memory was 211.6MB in the beginning and 208.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 254.8MB. Free memory was 208.4MB in the beginning and 206.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 543.50ms. Allocated memory is still 254.8MB. Free memory was 206.3MB in the beginning and 182.7MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 7.0GB. * TraceAbstraction took 847961.69ms. Allocated memory was 254.8MB in the beginning and 795.9MB in the end (delta: 541.1MB). Free memory was 182.2MB in the beginning and 540.0MB in the end (delta: -357.8MB). Peak memory consumption was 492.1MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 56, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 151, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 19, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 269, independent: 242, independent conditional: 242, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 234, Positive conditional cache size: 0, Positive unconditional cache size: 234, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 46, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 278, independent: 248, independent conditional: 248, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 303, Positive conditional cache size: 0, Positive unconditional cache size: 303, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 76, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 390, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 451, Positive cache size: 449, Positive conditional cache size: 0, Positive unconditional cache size: 449, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 4, Independence queries for same thread: 123, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2408, independent: 2004, independent conditional: 2004, independent unconditional: 0, dependent: 404, dependent conditional: 404, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 1965, Positive cache size: 1952, Positive conditional cache size: 0, Positive unconditional cache size: 1952, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 88, Maximal queried relation: 5, Independence queries for same thread: 511, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 798, independent: 714, independent conditional: 714, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 2104, Positive cache size: 2089, Positive conditional cache size: 0, Positive unconditional cache size: 2089, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 6, Independence queries for same thread: 593, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1007, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 2128, Positive cache size: 2113, Positive conditional cache size: 0, Positive unconditional cache size: 2113, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114, Maximal queried relation: 7, Independence queries for same thread: 685, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1416, independent: 1272, independent conditional: 1272, independent unconditional: 0, dependent: 144, dependent conditional: 144, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 2439, Positive cache size: 2424, Positive conditional cache size: 0, Positive unconditional cache size: 2424, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 138, Maximal queried relation: 8, Independence queries for same thread: 826, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1182, independent: 928, independent conditional: 928, independent unconditional: 0, dependent: 254, dependent conditional: 254, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7955, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 1105, dependent conditional: 1105, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6878, independent: 6850, independent conditional: 6850, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 165, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7043, independent: 6850, independent conditional: 0, independent unconditional: 6850, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2679, independent: 2664, independent conditional: 0, independent unconditional: 2664, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2679, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7043, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2679, unknown conditional: 0, unknown unconditional: 2679] , Statistics on independence cache: Total cache size (in pairs): 2679, Positive cache size: 2664, Positive conditional cache size: 0, Positive unconditional cache size: 2664, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 165, Maximal queried relation: 9, Independence queries for same thread: 1077, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1433, independent: 1325, independent conditional: 1325, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1331, independent: 1325, independent conditional: 1325, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1331, independent: 1325, independent conditional: 1325, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1361, independent: 1325, independent conditional: 0, independent unconditional: 1325, dependent: 36, dependent conditional: 30, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1361, independent: 1325, independent conditional: 0, independent unconditional: 1325, dependent: 36, dependent conditional: 1, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1361, independent: 1325, independent conditional: 0, independent unconditional: 1325, dependent: 36, dependent conditional: 1, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 366, independent: 359, independent conditional: 0, independent unconditional: 359, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 366, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1361, independent: 966, independent conditional: 0, independent unconditional: 966, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 366, unknown conditional: 1, unknown unconditional: 365] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 359, Positive conditional cache size: 0, Positive unconditional cache size: 359, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 5, Independence queries for same thread: 102 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-73-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-73-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-73-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-73-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-73-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 847.8s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 248.7s, 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: 203, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1910 ConstructedInterpolants, 158 QuantifiedInterpolants, 95724 SizeOfPredicates, 73 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 181/185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown