/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 13:37:45,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 13:37:45,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 13:37:45,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 13:37:45,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 13:37:45,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 13:37:45,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 13:37:45,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 13:37:45,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 13:37:45,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 13:37:45,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 13:37:45,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 13:37:45,985 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 13:37:45,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 13:37:45,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 13:37:45,986 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 13:37:45,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 13:37:45,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 13:37:45,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 13:37:45,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 13:37:45,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 13:37:45,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 13:37:45,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 13:37:45,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 13:37:45,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 13:37:45,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 13:37:45,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 13:37:45,991 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 13:37:45,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 13:37:45,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:37:45,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 13:37:45,993 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 13:37:45,994 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 13:37:45,994 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: DFS Order used in POR -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 13:37:46,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 13:37:46,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 13:37:46,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 13:37:46,263 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 13:37:46,264 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 13:37:46,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-11-17 13:37:47,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 13:37:47,747 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 13:37:47,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-11-17 13:37:47,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c01c5bf/52107cb19bae40c2973a25c7b13931dd/FLAG00de7d39f [2023-11-17 13:37:47,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c01c5bf/52107cb19bae40c2973a25c7b13931dd [2023-11-17 13:37:47,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 13:37:47,778 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 13:37:47,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 13:37:47,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 13:37:47,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 13:37:47,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:37:47" (1/1) ... [2023-11-17 13:37:47,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce729c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:47, skipping insertion in model container [2023-11-17 13:37:47,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:37:47" (1/1) ... [2023-11-17 13:37:47,833 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 13:37:48,188 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-11-17 13:37:48,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:37:48,238 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 13:37:48,274 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-11-17 13:37:48,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:37:48,365 INFO L206 MainTranslator]: Completed translation [2023-11-17 13:37:48,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48 WrapperNode [2023-11-17 13:37:48,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 13:37:48,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 13:37:48,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 13:37:48,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 13:37:48,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,414 INFO L138 Inliner]: procedures = 271, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 219 [2023-11-17 13:37:48,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 13:37:48,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 13:37:48,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 13:37:48,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 13:37:48,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 13:37:48,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 13:37:48,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 13:37:48,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 13:37:48,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (1/1) ... [2023-11-17 13:37:48,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:37:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:37:48,492 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-11-17 13:37:48,504 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-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-17 13:37:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-17 13:37:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 13:37:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 13:37:48,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 13:37:48,526 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 13:37:48,639 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 13:37:48,640 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 13:37:48,927 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 13:37:49,072 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 13:37:49,072 INFO L307 CfgBuilder]: Removed 23 assume(true) statements. [2023-11-17 13:37:49,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:37:49 BoogieIcfgContainer [2023-11-17 13:37:49,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 13:37:49,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 13:37:49,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 13:37:49,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 13:37:49,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:37:47" (1/3) ... [2023-11-17 13:37:49,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7404e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:37:49, skipping insertion in model container [2023-11-17 13:37:49,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:37:48" (2/3) ... [2023-11-17 13:37:49,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7404e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:37:49, skipping insertion in model container [2023-11-17 13:37:49,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:37:49" (3/3) ... [2023-11-17 13:37:49,081 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-11-17 13:37:49,089 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 13:37:49,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 13:37:49,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 13:37:49,098 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 13:37:49,148 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-17 13:37:49,179 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:37:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:37:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:37:49,181 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-11-17 13:37:49,185 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-11-17 13:37:49,213 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:37:49,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-11-17 13:37:49,233 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5605d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:37:49,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 13:37:49,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:37:49,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:37:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -856173414, now seen corresponding path program 1 times [2023-11-17 13:37:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:37:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954806677] [2023-11-17 13:37:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:37:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:37:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:37:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 13:37:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:37:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954806677] [2023-11-17 13:37:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954806677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:37:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:37:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:37:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033310925] [2023-11-17 13:37:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:37:49,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:37:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:37:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:37:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:37:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:37:49,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:37:49,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-11-17 13:37:49,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:37:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:37:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 13:37:49,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:37:49,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:37:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1044755833, now seen corresponding path program 1 times [2023-11-17 13:37:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:37:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136019137] [2023-11-17 13:37:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:37:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:37:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:37:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:37:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:37:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136019137] [2023-11-17 13:37:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136019137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:37:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923663199] [2023-11-17 13:37:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:37:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:37:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:37:49,983 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-11-17 13:37:50,000 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-11-17 13:37:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:37:50,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:37:50,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:37:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:37:50,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:37:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:37:50,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923663199] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:37:50,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:37:50,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:37:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977880007] [2023-11-17 13:37:50,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:37:50,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:37:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:37:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:37:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:37:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:37:50,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:37:50,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-11-17 13:37:50,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:37:50,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:37:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:37:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:37:50,257 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-11-17 13:37:50,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-17 13:37:50,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:37:50,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:37:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2036268191, now seen corresponding path program 2 times [2023-11-17 13:37:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:37:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272764005] [2023-11-17 13:37:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:37:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:37:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:37:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:37:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:37:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272764005] [2023-11-17 13:37:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272764005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:37:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176375583] [2023-11-17 13:37:50,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:37:50,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:37:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:37:50,649 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-11-17 13:37:50,650 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-11-17 13:37:50,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:37:50,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:37:50,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:37:50,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:37:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:37:50,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:37:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:37:50,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176375583] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:37:50,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:37:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:37:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433034425] [2023-11-17 13:37:50,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:37:50,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:37:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:37:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:37:50,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:37:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:37:50,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:37:50,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-11-17 13:37:50,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:37:50,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:37:50,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:37:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:37:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:37:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:37:50,917 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-11-17 13:37:51,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:37:51,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:37:51,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:37:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1425174111, now seen corresponding path program 3 times [2023-11-17 13:37:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:37:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278647172] [2023-11-17 13:37:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:37:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:37:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:37:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:37:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:37:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278647172] [2023-11-17 13:37:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278647172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:37:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982495682] [2023-11-17 13:37:51,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 13:37:51,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:37:51,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:37:51,381 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-11-17 13:37:51,406 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-11-17 13:37:51,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 13:37:51,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:37:51,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-17 13:37:51,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:37:51,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-17 13:37:51,645 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:37:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:37:51,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:37:51,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:37:51,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-17 13:37:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:37:51,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:01,812 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:38:01,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:38:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-11-17 13:38:01,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982495682] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:01,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-17 13:38:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547237557] [2023-11-17 13:38:01,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:01,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 13:38:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 13:38:01,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=120, Unknown=6, NotChecked=46, Total=210 [2023-11-17 13:38:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:01,957 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:01,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 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-11-17 13:38:01,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:01,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:01,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:01,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:38:04,648 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-11-17 13:38:04,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:04,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:04,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 875148085, now seen corresponding path program 1 times [2023-11-17 13:38:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738472167] [2023-11-17 13:38:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:04,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738472167] [2023-11-17 13:38:04,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738472167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:04,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692095685] [2023-11-17 13:38:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:04,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:04,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:04,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:04,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 13:38:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:05,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:38:05,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:05,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 13:38:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-17 13:38:05,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 13:38:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692095685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:38:05,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 13:38:05,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-17 13:38:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878968535] [2023-11-17 13:38:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:38:05,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:38:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:38:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 13:38:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:05,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:05,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11-17 13:38:05,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:05,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:05,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:38:05,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:38:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:05,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:05,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:05,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1520710715, now seen corresponding path program 1 times [2023-11-17 13:38:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934203275] [2023-11-17 13:38:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:05,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934203275] [2023-11-17 13:38:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934203275] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141682340] [2023-11-17 13:38:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:05,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:05,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 13:38:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:05,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:38:05,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:05,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141682340] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:05,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:05,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-17 13:38:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626958336] [2023-11-17 13:38:05,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:05,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:38:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:38:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:38:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:05,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:05,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-11-17 13:38:05,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:05,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:05,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:38:05,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:38:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:38:05,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 13:38:05,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:05,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:05,972 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-11-17 13:38:05,974 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-11-17 13:38:05,977 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:38:05,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:38:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:05,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 13:38:05,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-11-17 13:38:05,984 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:38:05,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 13:38:05,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5605d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:38:05,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-17 13:38:06,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:38:06,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1389258066, now seen corresponding path program 1 times [2023-11-17 13:38:06,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:06,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500080691] [2023-11-17 13:38:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500080691] [2023-11-17 13:38:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500080691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:38:06,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:38:06,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:38:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652345063] [2023-11-17 13:38:06,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:38:06,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:38:06,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:38:06,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:38:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:06,085 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:06,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-11-17 13:38:06,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:06,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 13:38:06,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:38:06,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1594231956, now seen corresponding path program 1 times [2023-11-17 13:38:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032088969] [2023-11-17 13:38:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032088969] [2023-11-17 13:38:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032088969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515958949] [2023-11-17 13:38:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:06,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:06,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 13:38:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:06,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:38:06,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515958949] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:06,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:06,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:38:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122381961] [2023-11-17 13:38:06,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:06,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:38:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:06,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:38:06,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:38:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:06,259 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:06,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-11-17 13:38:06,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:06,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:06,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:06,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-17 13:38:06,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:38:06,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1213078482, now seen corresponding path program 2 times [2023-11-17 13:38:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:06,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504090084] [2023-11-17 13:38:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504090084] [2023-11-17 13:38:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504090084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162553384] [2023-11-17 13:38:06,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:38:06,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:06,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:06,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 13:38:06,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:38:06,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:38:06,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:38:06,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 13:38:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162553384] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:06,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:38:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323521940] [2023-11-17 13:38:06,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:38:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:38:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:38:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:06,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:06,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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-11-17 13:38:06,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:06,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:06,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:06,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:06,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:06,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:38:06,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1747522962, now seen corresponding path program 3 times [2023-11-17 13:38:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044437627] [2023-11-17 13:38:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:38:06,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 13:38:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:38:07,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 13:38:07,030 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 13:38:07,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-17 13:38:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-17 13:38:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 13:38:07,033 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-11-17 13:38:07,034 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-11-17 13:38:07,034 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 13:38:07,034 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 13:38:07,059 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 13:38:07,061 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:38:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:38:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:07,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 13:38:07,067 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:38:07,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-11-17 13:38:07,068 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5605d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:38:07,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 13:38:07,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-11-17 13:38:07,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:07,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1300701028, now seen corresponding path program 1 times [2023-11-17 13:38:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:07,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794358874] [2023-11-17 13:38:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-17 13:38:07,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794358874] [2023-11-17 13:38:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794358874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:38:07,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:38:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:38:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866983934] [2023-11-17 13:38:07,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:38:07,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:38:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:07,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:38:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:38:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:07,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:07,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-11-17 13:38:07,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:10,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 13:38:10,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:10,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1576851318, now seen corresponding path program 1 times [2023-11-17 13:38:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:10,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186836093] [2023-11-17 13:38:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:38:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186836093] [2023-11-17 13:38:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186836093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637736967] [2023-11-17 13:38:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:10,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:10,125 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:10,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 13:38:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:10,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:38:10,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:38:10,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:38:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637736967] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:10,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:38:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797953044] [2023-11-17 13:38:10,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:10,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:38:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:38:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:38:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:10,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:10,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-11-17 13:38:10,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:10,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:11,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:11,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 13:38:11,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:11,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 788531400, now seen corresponding path program 2 times [2023-11-17 13:38:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087807675] [2023-11-17 13:38:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:38:11,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:11,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087807675] [2023-11-17 13:38:11,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087807675] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289102958] [2023-11-17 13:38:11,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:38:11,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:11,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:11,446 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:11,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 13:38:11,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:38:11,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:38:11,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:38:11,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:38:11,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 13:38:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289102958] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:11,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:11,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:38:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029168080] [2023-11-17 13:38:11,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:11,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:38:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:38:11,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:38:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:11,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:11,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 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-11-17 13:38:11,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:11,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:11,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:12,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:12,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 13:38:12,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:12,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -144578040, now seen corresponding path program 3 times [2023-11-17 13:38:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032241796] [2023-11-17 13:38:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:12,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:12,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032241796] [2023-11-17 13:38:12,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032241796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:12,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169918969] [2023-11-17 13:38:12,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 13:38:12,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:12,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:12,795 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:12,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 13:38:12,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 13:38:12,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:38:12,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-17 13:38:12,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:12,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-17 13:38:12,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:38:12,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:38:13,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:38:13,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:38:13,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-17 13:38:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:13,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:19,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_549) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:38:21,173 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_549) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:38:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 5 not checked. [2023-11-17 13:38:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169918969] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:21,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2023-11-17 13:38:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608403555] [2023-11-17 13:38:21,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:21,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 13:38:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 13:38:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=5, NotChecked=50, Total=240 [2023-11-17 13:38:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:21,267 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:21,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 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-11-17 13:38:21,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:21,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:21,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:21,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:22,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:22,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 13:38:22,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:22,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1841568849, now seen corresponding path program 1 times [2023-11-17 13:38:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770189229] [2023-11-17 13:38:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-17 13:38:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770189229] [2023-11-17 13:38:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770189229] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304173880] [2023-11-17 13:38:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:23,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:23,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 13:38:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:23,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 13:38:23,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:23,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 13:38:23,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:38:23,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 13:38:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-17 13:38:23,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:23,299 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_t_funThread2of2ForFork0_~p~0#1.base| v_ArrVal_629) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|) 0))) is different from false [2023-11-17 13:38:23,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:38:23,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-17 13:38:23,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-17 13:38:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 1 not checked. [2023-11-17 13:38:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304173880] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:23,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2023-11-17 13:38:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329038509] [2023-11-17 13:38:23,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:23,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:38:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:38:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=92, Unknown=3, NotChecked=20, Total=156 [2023-11-17 13:38:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:23,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:23,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:38:23,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:23,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:23,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:23,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:23,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:38:24,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:24,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:24,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:24,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1837430990, now seen corresponding path program 1 times [2023-11-17 13:38:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42756216] [2023-11-17 13:38:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:38:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42756216] [2023-11-17 13:38:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42756216] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854278670] [2023-11-17 13:38:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:27,767 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:27,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 13:38:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:27,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-17 13:38:27,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-17 13:38:27,992 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:38:27,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:38:28,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:38:28,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-17 13:38:28,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:38:28,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:38:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-11-17 13:38:28,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:38:28,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-11-17 13:38:28,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-17 13:38:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:28,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:28,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-11-17 13:38:30,941 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_716 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= 0 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_716 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716))) (store .cse2 |c_~#a~0.base| (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (store .cse3 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-11-17 13:38:30,973 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_716 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716) |c_~#a~0.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-11-17 13:38:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 5 not checked. [2023-11-17 13:38:31,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854278670] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:31,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:31,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2023-11-17 13:38:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246856583] [2023-11-17 13:38:31,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-17 13:38:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-17 13:38:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1050, Unknown=9, NotChecked=134, Total=1332 [2023-11-17 13:38:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:31,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:31,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4864864864864864) internal successors, (92), 36 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 13:38:31,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:31,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:31,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:31,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:31,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:38:31,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:38:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:38:34,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:34,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 13:38:34,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:34,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash -779250869, now seen corresponding path program 1 times [2023-11-17 13:38:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226318139] [2023-11-17 13:38:34,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:34,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:38:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226318139] [2023-11-17 13:38:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226318139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:38:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708381347] [2023-11-17 13:38:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:34,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:38:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:38:34,851 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:38:34,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 13:38:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:38:35,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-17 13:38:35,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:38:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:35,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:38:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:38:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708381347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:38:35,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:38:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-17 13:38:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459855914] [2023-11-17 13:38:35,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:38:35,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 13:38:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:38:35,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 13:38:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-11-17 13:38:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:35,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:38:35,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:38:35,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:38:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:38:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:38:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:38:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:38:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:38:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:38:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:38:35,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 13:38:35,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-17 13:38:35,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:38:35,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:38:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash 813390974, now seen corresponding path program 2 times [2023-11-17 13:38:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:38:35,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616884855] [2023-11-17 13:38:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:38:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:38:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:39:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616884855] [2023-11-17 13:39:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616884855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:39:01,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941075391] [2023-11-17 13:39:01,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:39:01,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:01,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:01,137 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:39:01,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-17 13:39:01,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:39:01,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:39:01,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 13:39:01,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:39:01,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-17 13:39:01,352 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:39:01,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:39:01,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:39:01,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:39:01,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-17 13:39:01,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:39:01,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:39:01,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-17 13:39:01,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-11-17 13:39:01,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:39:01,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-17 13:39:01,768 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:39:01,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-11-17 13:39:01,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-17 13:39:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:39:01,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:39:01,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_917) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-11-17 13:39:01,919 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_917) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1)))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-11-17 13:39:01,961 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_917) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-11-17 13:39:01,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:39:01,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-17 13:39:01,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 13:39:01,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-11-17 13:39:01,986 INFO L378 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 22 treesize of output 18 [2023-11-17 13:39:09,398 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_914 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914))) (store .cse3 |c_~#a~0.base| (let ((.cse4 (select .cse3 |c_~#a~0.base|))) (store .cse4 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))))) (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_914 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= 0 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or .cse2 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or .cse2 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2023-11-17 13:39:11,458 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_914 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914) |c_~#a~0.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_914 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914) |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-11-17 13:39:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2023-11-17 13:39:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941075391] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:39:11,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:39:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 39 [2023-11-17 13:39:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569110207] [2023-11-17 13:39:11,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:39:11,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-17 13:39:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-17 13:39:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1048, Unknown=23, NotChecked=350, Total=1560 [2023-11-17 13:39:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:11,698 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:11,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.25) internal successors, (90), 39 states have internal predecessors, (90), 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-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-17 13:39:18,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-17 13:39:18,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-17 13:39:18,835 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:39:18,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1040703175, now seen corresponding path program 1 times [2023-11-17 13:39:18,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119885156] [2023-11-17 13:39:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:39:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:19,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119885156] [2023-11-17 13:39:19,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119885156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:39:19,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291206960] [2023-11-17 13:39:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:19,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:19,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:19,315 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:39:19,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-17 13:39:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:19,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-17 13:39:19,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:39:19,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-17 13:39:19,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:39:19,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:39:19,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:39:19,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:39:19,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:39:19,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-11-17 13:39:19,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-11-17 13:39:19,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-17 13:39:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:39:19,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:39:27,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:39:35,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:39:35,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1019) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:39:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 5 not checked. [2023-11-17 13:39:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291206960] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:39:35,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:39:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2023-11-17 13:39:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332899384] [2023-11-17 13:39:35,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:39:35,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 13:39:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 13:39:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=309, Unknown=6, NotChecked=114, Total=506 [2023-11-17 13:39:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:35,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:35,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 22 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-11-17 13:39:35,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-17 13:39:35,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:39:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 13:39:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 13:39:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-17 13:39:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:36,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 13:39:36,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-17 13:39:37,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:37,130 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-11-17 13:39:37,130 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2023-11-17 13:39:37,132 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:39:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:39:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:37,134 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 13:39:37,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2023-11-17 13:39:37,142 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:39:37,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 13:39:37,143 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5605d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:39:37,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-17 13:39:37,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:37,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:37,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1894716789, now seen corresponding path program 1 times [2023-11-17 13:39:37,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:37,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455013272] [2023-11-17 13:39:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:37,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455013272] [2023-11-17 13:39:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455013272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:39:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:39:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:39:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530998747] [2023-11-17 13:39:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:39:37,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:39:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:39:37,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:39:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:37,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:37,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-11-17 13:39:37,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:37,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 13:39:37,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:37,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1485184890, now seen corresponding path program 1 times [2023-11-17 13:39:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:37,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694438522] [2023-11-17 13:39:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694438522] [2023-11-17 13:39:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694438522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:39:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823943108] [2023-11-17 13:39:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:37,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:37,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:37,326 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:39:37,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-17 13:39:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:37,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:39:37,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:39:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:39:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823943108] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:39:37,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:39:37,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:39:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165783970] [2023-11-17 13:39:37,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:39:37,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:39:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:39:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:39:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:37,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:37,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-11-17 13:39:37,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:37,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:37,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-17 13:39:37,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-17 13:39:37,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:37,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash -613758516, now seen corresponding path program 2 times [2023-11-17 13:39:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852293872] [2023-11-17 13:39:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:37,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852293872] [2023-11-17 13:39:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852293872] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:39:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196225223] [2023-11-17 13:39:37,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:39:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:37,789 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:39:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-17 13:39:37,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:39:37,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:39:37,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:39:37,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:39:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:39:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 13:39:37,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196225223] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:39:37,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:39:37,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:39:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105057663] [2023-11-17 13:39:37,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:39:37,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:39:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:37,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:39:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:39:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:37,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:37,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 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-11-17 13:39:37,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:37,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:37,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:38,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-17 13:39:38,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-17 13:39:38,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:38,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1469101300, now seen corresponding path program 3 times [2023-11-17 13:39:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376422653] [2023-11-17 13:39:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:39:38,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 13:39:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:39:38,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 13:39:38,272 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 13:39:38,272 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-17 13:39:38,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-17 13:39:38,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 13:39:38,273 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-11-17 13:39:38,274 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2023-11-17 13:39:38,274 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 13:39:38,274 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 13:39:38,298 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 13:39:38,300 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:39:38,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:39:38,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:38,301 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 13:39:38,308 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:39:38,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2023-11-17 13:39:38,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 13:39:38,309 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5605d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:39:38,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-17 13:39:38,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:38,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2074968187, now seen corresponding path program 1 times [2023-11-17 13:39:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:38,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316163340] [2023-11-17 13:39:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316163340] [2023-11-17 13:39:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316163340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:39:38,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:39:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:39:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371020256] [2023-11-17 13:39:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:39:38,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:39:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:38,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:39:38,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:39:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:38,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-11-17 13:39:38,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:38,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-17 13:39:38,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:38,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash -279056343, now seen corresponding path program 1 times [2023-11-17 13:39:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252442417] [2023-11-17 13:39:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:38,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252442417] [2023-11-17 13:39:38,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252442417] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:39:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017903505] [2023-11-17 13:39:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:38,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:38,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:38,590 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:39:38,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-17 13:39:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:38,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:39:38,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:39:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:38,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:39:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017903505] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:39:38,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:39:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:39:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489872775] [2023-11-17 13:39:38,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:39:38,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:39:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:39:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:39:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:38,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:38,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-11-17 13:39:38,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:38,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:38,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-17 13:39:38,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:38,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:38,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash -900569430, now seen corresponding path program 2 times [2023-11-17 13:39:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812059281] [2023-11-17 13:39:38,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:39,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812059281] [2023-11-17 13:39:39,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812059281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:39:39,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011058474] [2023-11-17 13:39:39,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:39:39,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:39:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:39,057 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:39:39,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-17 13:39:39,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:39:39,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:39:39,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:39:39,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:39:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:39,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:39:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 13:39:39,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011058474] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:39:39,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:39:39,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:39:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718789429] [2023-11-17 13:39:39,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:39:39,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:39:39,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:39,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:39:39,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:39:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:39,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:39,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-11-17 13:39:39,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:39,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:39,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:39:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:39:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:39:39,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-17 13:39:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-17 13:39:39,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 13:39:39,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1812244042, now seen corresponding path program 3 times [2023-11-17 13:39:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22798450] [2023-11-17 13:39:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:39:39,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 13:39:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:39:39,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 13:39:39,580 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 13:39:39,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-17 13:39:39,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-17 13:39:39,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-17 13:39:39,581 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-11-17 13:39:39,581 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2023-11-17 13:39:39,582 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 13:39:39,582 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-17 13:39:39,609 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-17 13:39:39,611 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:39:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:39:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:39:39,612 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 13:39:39,621 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:39:39,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2023-11-17 13:39:39,622 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5605d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:39:39,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-17 13:39:39,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2023-11-17 13:39:40,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:39:40,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:39:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash 556023849, now seen corresponding path program 1 times [2023-11-17 13:39:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:39:40,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40831328] [2023-11-17 13:39:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:39:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:39:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:39:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-17 13:39:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:39:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40831328] [2023-11-17 13:39:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40831328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:39:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:39:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 13:39:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590070667] [2023-11-17 13:39:40,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:39:40,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:39:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:39:40,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:39:40,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:39:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:39:40,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:39:40,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-11-17 13:39:40,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:07,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-17 13:40:07,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:40:07,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:40:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1553109677, now seen corresponding path program 1 times [2023-11-17 13:40:07,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:40:07,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880775600] [2023-11-17 13:40:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:40:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:40:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:40:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 13:40:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:40:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880775600] [2023-11-17 13:40:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880775600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:40:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708933235] [2023-11-17 13:40:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:40:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:40:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:40:07,469 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:40:07,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-17 13:40:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:40:07,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 13:40:07,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:40:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 13:40:07,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:40:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 13:40:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708933235] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:40:07,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:40:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-17 13:40:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830158951] [2023-11-17 13:40:07,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:40:07,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:40:07,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:40:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:40:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:40:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:07,690 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:40:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 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-11-17 13:40:07,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:07,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:40:23,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-17 13:40:23,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-17 13:40:23,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:40:23,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:40:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1220243404, now seen corresponding path program 2 times [2023-11-17 13:40:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:40:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235747691] [2023-11-17 13:40:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:40:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:40:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:40:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-17 13:40:23,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:40:23,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235747691] [2023-11-17 13:40:23,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235747691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:40:23,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:40:23,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 13:40:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668166621] [2023-11-17 13:40:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:40:23,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 13:40:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:40:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 13:40:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 13:40:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:23,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:40:23,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-17 13:40:23,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:23,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:40:23,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:40:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:29,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-17 13:40:29,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:40:29,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:40:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -989428110, now seen corresponding path program 1 times [2023-11-17 13:40:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:40:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479660072] [2023-11-17 13:40:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:40:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:40:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:40:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 13:40:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:40:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479660072] [2023-11-17 13:40:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479660072] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:40:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20667025] [2023-11-17 13:40:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:40:29,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:40:29,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:40:29,569 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:40:29,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-17 13:40:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:40:29,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 13:40:29,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:40:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 13:40:29,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:40:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 13:40:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20667025] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:40:29,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:40:29,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 13:40:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520600740] [2023-11-17 13:40:29,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:40:29,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 13:40:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:40:29,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 13:40:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 13:40:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:29,815 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:40:29,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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-11-17 13:40:29,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:29,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:40:29,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:29,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:40:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:40:35,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-17 13:40:35,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:40:35,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 13:40:35,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:40:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1285065426, now seen corresponding path program 2 times [2023-11-17 13:40:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:40:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30484191] [2023-11-17 13:40:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:40:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:40:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:40:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:40:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:40:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30484191] [2023-11-17 13:40:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30484191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 13:40:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253878515] [2023-11-17 13:40:46,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 13:40:46,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:40:46,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:40:46,138 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 13:40:46,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-17 13:40:46,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 13:40:46,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 13:40:46,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-17 13:40:46,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 13:40:46,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-17 13:40:46,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 13:40:46,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 13:40:46,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:40:46,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:40:46,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-17 13:40:46,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:40:46,793 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2023-11-17 13:40:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2023-11-17 13:40:47,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:40:47,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:40:47,153 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-11-17 13:40:47,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2023-11-17 13:40:47,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:40:47,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-17 13:40:47,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:40:47,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:40:47,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 13:40:47,683 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-17 13:40:47,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2023-11-17 13:40:47,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-17 13:40:47,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-11-17 13:40:48,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-11-17 13:40:48,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2023-11-17 13:40:48,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2023-11-17 13:40:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-17 13:40:48,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 13:40:48,727 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1656 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1))))))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2023-11-17 13:40:49,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1655) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1))))))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2023-11-17 13:40:51,110 INFO L349 Elim1Store]: treesize reduction 108, result has 32.1 percent of original size [2023-11-17 13:40:51,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 104 [2023-11-17 13:40:51,181 INFO L349 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2023-11-17 13:40:51,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 137 [2023-11-17 13:40:51,197 INFO L378 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 22 treesize of output 18 [2023-11-17 13:40:51,279 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 13:40:51,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2023-11-17 13:40:51,332 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-17 13:40:51,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2023-11-17 13:40:53,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse4 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse0 (let ((.cse1 (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse1 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse0 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse0 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (or .cse4 (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse5 (let ((.cse6 (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse8 (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse8 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse8 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse6 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse5 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse9 (let ((.cse10 (select (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse11 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select .cse11 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse10 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse10 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse9 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse9 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse13 (let ((.cse14 (select (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse15 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse16 (select .cse15 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse16 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse16 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse14 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse14 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse13 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse13 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) .cse17))) (or .cse17 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse18 (let ((.cse19 (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse20 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse21 (select .cse20 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse21 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse21 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse19 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse19 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse18 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse18 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|)))) (or .cse4 (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse22 (let ((.cse23 (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse23 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse23 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse22 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse22 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse26 (let ((.cse27 (select (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse28 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse29 (select .cse28 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse29 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse27 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse27 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse26 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse26 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (or .cse17 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse30 (let ((.cse31 (select (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse32 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse33 (select .cse32 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse33 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse33 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse31 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse31 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse30 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse30 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse34 (let ((.cse35 (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse36 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse37 (select .cse36 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse37 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse37 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse35 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse35 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse34 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse34 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (let ((.cse38 (let ((.cse39 (select (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse41 (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse41 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse39 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse39 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse38 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse38 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) .cse17) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse42 (let ((.cse43 (select (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse44 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse45 (select .cse44 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse45 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse45 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse43 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse43 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse42 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse42 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))))) (or .cse4 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse46 (let ((.cse47 (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656))) (store .cse48 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse49 (select .cse48 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse49 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse49 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) |c_~#a~0.base|))) (store .cse47 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse47 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse46 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse46 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|)))))) is different from false [2023-11-17 13:40:55,911 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_1656 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) (store .cse1 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse0 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse0 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1656 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1656) |c_~#a~0.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))))) (store .cse4 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse3 |t_funThread3of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread3of4ForFork0_~p~0#1.offset|) 1))) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) is different from false [2023-11-17 13:40:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 55 trivial. 19 not checked. [2023-11-17 13:40:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253878515] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 13:40:56,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 13:40:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17, 18] total 60 [2023-11-17 13:40:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925056993] [2023-11-17 13:40:56,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 13:40:56,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-17 13:40:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:40:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-17 13:40:56,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2915, Unknown=34, NotChecked=452, Total=3660 [2023-11-17 13:40:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:40:56,668 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:40:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 states have internal predecessors, (175), 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-11-17 13:40:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:40:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 13:40:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-17 13:40:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:41:07,890 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 [0, 1] [2023-11-17 13:41:10,299 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 [0, 1] [2023-11-17 13:41:12,401 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 [0, 1] [2023-11-17 13:41:14,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:41:16,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:41:18,849 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 [0, 1] [2023-11-17 13:41:20,893 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 [0, 1] [2023-11-17 13:41:22,904 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 [0, 1] [2023-11-17 13:41:29,535 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 [0, 1] [2023-11-17 13:41:31,561 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 [0, 1] [2023-11-17 13:41:33,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:41:38,504 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 [0, 1] [2023-11-17 13:41:40,590 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 [0, 1] [2023-11-17 13:41:46,836 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 [0, 1] [2023-11-17 13:41:48,939 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 [0, 1] [2023-11-17 13:41:51,177 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 [0, 1] [2023-11-17 13:41:52,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:41:56,724 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 [0, 1] [2023-11-17 13:41:58,788 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 [0, 1] [2023-11-17 13:42:00,824 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 [0, 1] [2023-11-17 13:42:07,808 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 [0, 1] [2023-11-17 13:42:09,846 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 [0, 1] [2023-11-17 13:42:12,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:42:14,302 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 [0, 1] [2023-11-17 13:42:24,434 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 [0, 1] [2023-11-17 13:42:30,430 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 [0, 1] [2023-11-17 13:42:32,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:42:34,942 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 [0, 1] [2023-11-17 13:42:38,747 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 [0, 1] [2023-11-17 13:42:40,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:42:46,992 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 [0, 1] [2023-11-17 13:42:49,331 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 [0, 1] [2023-11-17 13:42:52,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:42:54,741 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 [0, 1] [2023-11-17 13:42:56,870 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 [0, 1] [2023-11-17 13:42:59,112 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 [0, 1] [2023-11-17 13:43:01,117 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 [0, 1] [2023-11-17 13:43:03,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:43:05,142 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 [0, 1] [2023-11-17 13:43:07,490 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 [0, 1] [2023-11-17 13:43:09,937 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 [0, 1] [2023-11-17 13:43:12,081 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 [0, 1] [2023-11-17 13:43:14,086 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 [0, 1] [2023-11-17 13:43:16,096 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 [0, 1] [2023-11-17 13:43:19,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:43:21,029 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 [0, 1] [2023-11-17 13:43:23,800 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 [0, 1] [2023-11-17 13:43:29,379 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 [0, 1] [2023-11-17 13:43:34,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:43:38,573 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 [0, 1] [2023-11-17 13:43:48,604 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 [0, 1] [2023-11-17 13:43:50,656 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 [0, 1] [2023-11-17 13:43:52,934 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 [0, 1] [2023-11-17 13:43:55,164 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 [0, 1] [2023-11-17 13:43:57,414 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 [0, 1] [2023-11-17 13:44:00,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:44:03,108 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 [0, 1] [2023-11-17 13:44:05,207 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 [0, 1] [2023-11-17 13:44:20,073 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 [0, 1] [2023-11-17 13:44:22,162 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 [0, 1] [2023-11-17 13:44:24,318 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 [0, 1] [2023-11-17 13:44:27,233 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 [0, 1] [2023-11-17 13:44:30,377 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 [0, 1] [2023-11-17 13:44:32,938 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 [0, 1] [2023-11-17 13:44:43,512 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 [0, 1] [2023-11-17 13:44:45,704 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 [0, 1] [2023-11-17 13:44:47,844 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 [0, 1] [2023-11-17 13:44:52,908 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 [0, 1] [2023-11-17 13:45:01,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:45:03,769 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 [0, 1] [2023-11-17 13:45:06,322 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 [0, 1] [2023-11-17 13:45:08,502 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 [0, 1] [2023-11-17 13:45:10,505 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 [0, 1] [2023-11-17 13:45:12,545 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 [0, 1] [2023-11-17 13:45:14,645 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 [0, 1] [2023-11-17 13:45:16,731 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 [0, 1] [2023-11-17 13:45:20,664 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 [0, 1] [2023-11-17 13:45:23,391 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 [0, 1] [2023-11-17 13:45:26,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:45:28,139 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 [0, 1] [2023-11-17 13:45:30,307 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 [0, 1] [2023-11-17 13:45:31,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 13:45:33,722 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 [0, 1] [2023-11-17 13:45:36,082 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 [0, 1] Received shutdown request... [2023-11-17 13:46:11,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-11-17 13:46:11,836 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:46:11,836 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:46:11,837 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:46:11,837 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:46:11,837 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-11-17 13:46:11,837 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-11-17 13:46:11,837 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:46:11,837 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 13:46:12,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 13:46:12,009 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2023-11-17 13:46:12,009 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-17 13:46:12,010 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2023-11-17 13:46:12,011 INFO L307 ceAbstractionStarter]: Result for error location t_funThread4of4ForFork0 was TIMEOUT (1/5) [2023-11-17 13:46:12,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2023-11-17 13:46:12,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 13:46:12,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 01:46:12 BasicIcfg [2023-11-17 13:46:12,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 13:46:12,016 INFO L158 Benchmark]: Toolchain (without parser) took 504238.11ms. Allocated memory was 263.2MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 212.9MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-11-17 13:46:12,016 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 13:46:12,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.34ms. Allocated memory is still 263.2MB. Free memory was 212.5MB in the beginning and 182.9MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-11-17 13:46:12,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.84ms. Allocated memory is still 263.2MB. Free memory was 182.9MB in the beginning and 179.9MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 13:46:12,016 INFO L158 Benchmark]: Boogie Preprocessor took 42.21ms. Allocated memory is still 263.2MB. Free memory was 179.9MB in the beginning and 177.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 13:46:12,017 INFO L158 Benchmark]: RCFGBuilder took 616.11ms. Allocated memory is still 263.2MB. Free memory was 177.8MB in the beginning and 209.2MB in the end (delta: -31.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-11-17 13:46:12,017 INFO L158 Benchmark]: TraceAbstraction took 502939.47ms. Allocated memory was 263.2MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 208.1MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-11-17 13:46:12,018 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.13ms. Allocated memory is still 173.0MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 587.34ms. Allocated memory is still 263.2MB. Free memory was 212.5MB in the beginning and 182.9MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.84ms. Allocated memory is still 263.2MB. Free memory was 182.9MB in the beginning and 179.9MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.21ms. Allocated memory is still 263.2MB. Free memory was 179.9MB in the beginning and 177.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.11ms. Allocated memory is still 263.2MB. Free memory was 177.8MB in the beginning and 209.2MB in the end (delta: -31.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 502939.47ms. Allocated memory was 263.2MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 208.1MB in the beginning and 6.0GB in the end (delta: -5.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9714, independent: 8861, independent conditional: 1806, independent unconditional: 7055, dependent: 853, dependent conditional: 767, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8999, independent: 8861, independent conditional: 1806, independent unconditional: 7055, dependent: 138, dependent conditional: 52, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8999, independent: 8861, independent conditional: 1806, independent unconditional: 7055, dependent: 138, dependent conditional: 52, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9072, independent: 8861, independent conditional: 13, independent unconditional: 8848, dependent: 211, dependent conditional: 60, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9072, independent: 8861, independent conditional: 13, independent unconditional: 8848, dependent: 211, dependent conditional: 20, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9072, independent: 8861, independent conditional: 13, independent unconditional: 8848, dependent: 211, dependent conditional: 20, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3533, independent: 3428, independent conditional: 11, independent unconditional: 3417, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3533, independent: 3348, independent conditional: 0, independent unconditional: 3348, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 185, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 185, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 394, independent: 180, independent conditional: 17, independent unconditional: 163, dependent: 214, dependent conditional: 43, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9072, independent: 5433, independent conditional: 2, independent unconditional: 5431, dependent: 106, dependent conditional: 1, dependent unconditional: 105, unknown: 3533, unknown conditional: 30, unknown unconditional: 3503] , Statistics on independence cache: Total cache size (in pairs): 3533, Positive cache size: 3428, Positive conditional cache size: 11, Positive unconditional cache size: 3417, Negative cache size: 105, Negative conditional cache size: 19, Negative unconditional cache size: 86, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 3, Independence queries for same thread: 715 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 487, Number of trivial persistent sets: 307, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7141, independent: 7055, independent conditional: 0, independent unconditional: 7055, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9714, independent: 8861, independent conditional: 1806, independent unconditional: 7055, dependent: 853, dependent conditional: 767, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8999, independent: 8861, independent conditional: 1806, independent unconditional: 7055, dependent: 138, dependent conditional: 52, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8999, independent: 8861, independent conditional: 1806, independent unconditional: 7055, dependent: 138, dependent conditional: 52, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9072, independent: 8861, independent conditional: 13, independent unconditional: 8848, dependent: 211, dependent conditional: 60, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9072, independent: 8861, independent conditional: 13, independent unconditional: 8848, dependent: 211, dependent conditional: 20, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9072, independent: 8861, independent conditional: 13, independent unconditional: 8848, dependent: 211, dependent conditional: 20, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3533, independent: 3428, independent conditional: 11, independent unconditional: 3417, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3533, independent: 3348, independent conditional: 0, independent unconditional: 3348, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 185, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 185, independent: 80, independent conditional: 11, independent unconditional: 69, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 394, independent: 180, independent conditional: 17, independent unconditional: 163, dependent: 214, dependent conditional: 43, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9072, independent: 5433, independent conditional: 2, independent unconditional: 5431, dependent: 106, dependent conditional: 1, dependent unconditional: 105, unknown: 3533, unknown conditional: 30, unknown unconditional: 3503] , Statistics on independence cache: Total cache size (in pairs): 3533, Positive cache size: 3428, Positive conditional cache size: 11, Positive unconditional cache size: 3417, Negative cache size: 105, Negative conditional cache size: 19, Negative unconditional cache size: 86, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 3, Independence queries for same thread: 715 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 252, independent: 216, independent conditional: 28, independent unconditional: 188, dependent: 36, dependent conditional: 31, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 28, independent unconditional: 188, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 28, independent unconditional: 188, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 221, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 188, independent: 183, independent conditional: 0, independent unconditional: 183, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 221, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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: 31 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 9, Number of trivial persistent sets: 8, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 252, independent: 216, independent conditional: 28, independent unconditional: 188, dependent: 36, dependent conditional: 31, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 28, independent unconditional: 188, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 28, independent unconditional: 188, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 221, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 221, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 188, independent: 183, independent conditional: 0, independent unconditional: 183, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 221, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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: 31 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 648840, independent: 548877, independent conditional: 523685, independent unconditional: 25192, dependent: 99963, dependent conditional: 99695, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 563956, independent: 548877, independent conditional: 523685, independent unconditional: 25192, dependent: 15079, dependent conditional: 14811, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 563956, independent: 548877, independent conditional: 523685, independent unconditional: 25192, dependent: 15079, dependent conditional: 14811, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 581754, independent: 548877, independent conditional: 7257, independent unconditional: 541620, dependent: 32877, dependent conditional: 16400, dependent unconditional: 16477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 581754, independent: 548877, independent conditional: 1626, independent unconditional: 547251, dependent: 32877, dependent conditional: 2230, dependent unconditional: 30647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 581754, independent: 548877, independent conditional: 1626, independent unconditional: 547251, dependent: 32877, dependent conditional: 2230, dependent unconditional: 30647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11942, independent: 11437, independent conditional: 152, independent unconditional: 11285, dependent: 505, dependent conditional: 237, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11942, independent: 11056, independent conditional: 0, independent unconditional: 11056, dependent: 886, dependent conditional: 0, dependent unconditional: 886, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 886, independent: 381, independent conditional: 152, independent unconditional: 229, dependent: 505, dependent conditional: 237, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 886, independent: 381, independent conditional: 152, independent unconditional: 229, dependent: 505, dependent conditional: 237, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1651, independent: 616, independent conditional: 289, independent unconditional: 328, dependent: 1034, dependent conditional: 549, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 581754, independent: 537440, independent conditional: 1474, independent unconditional: 535966, dependent: 32372, dependent conditional: 1993, dependent unconditional: 30379, unknown: 11942, unknown conditional: 389, unknown unconditional: 11553] , Statistics on independence cache: Total cache size (in pairs): 11942, Positive cache size: 11437, Positive conditional cache size: 152, Positive unconditional cache size: 11285, Negative cache size: 505, Negative conditional cache size: 237, Negative unconditional cache size: 268, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19801, Maximal queried relation: 6, Independence queries for same thread: 84884 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 1.3s, Number of persistent set computation: 13129, Number of trivial persistent sets: 6982, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25460, independent: 25192, independent conditional: 0, independent unconditional: 25192, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 648840, independent: 548877, independent conditional: 523685, independent unconditional: 25192, dependent: 99963, dependent conditional: 99695, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 563956, independent: 548877, independent conditional: 523685, independent unconditional: 25192, dependent: 15079, dependent conditional: 14811, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 563956, independent: 548877, independent conditional: 523685, independent unconditional: 25192, dependent: 15079, dependent conditional: 14811, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 581754, independent: 548877, independent conditional: 7257, independent unconditional: 541620, dependent: 32877, dependent conditional: 16400, dependent unconditional: 16477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 581754, independent: 548877, independent conditional: 1626, independent unconditional: 547251, dependent: 32877, dependent conditional: 2230, dependent unconditional: 30647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 581754, independent: 548877, independent conditional: 1626, independent unconditional: 547251, dependent: 32877, dependent conditional: 2230, dependent unconditional: 30647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11942, independent: 11437, independent conditional: 152, independent unconditional: 11285, dependent: 505, dependent conditional: 237, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11942, independent: 11056, independent conditional: 0, independent unconditional: 11056, dependent: 886, dependent conditional: 0, dependent unconditional: 886, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 886, independent: 381, independent conditional: 152, independent unconditional: 229, dependent: 505, dependent conditional: 237, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 886, independent: 381, independent conditional: 152, independent unconditional: 229, dependent: 505, dependent conditional: 237, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1651, independent: 616, independent conditional: 289, independent unconditional: 328, dependent: 1034, dependent conditional: 549, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 581754, independent: 537440, independent conditional: 1474, independent unconditional: 535966, dependent: 32372, dependent conditional: 1993, dependent unconditional: 30379, unknown: 11942, unknown conditional: 389, unknown unconditional: 11553] , Statistics on independence cache: Total cache size (in pairs): 11942, Positive cache size: 11437, Positive conditional cache size: 152, Positive unconditional cache size: 11285, Negative cache size: 505, Negative conditional cache size: 237, Negative unconditional cache size: 268, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19801, Maximal queried relation: 6, Independence queries for same thread: 84884 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1154, independent: 1072, independent conditional: 179, independent unconditional: 893, dependent: 82, dependent conditional: 62, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 179, independent unconditional: 893, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 179, independent unconditional: 893, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 889, independent: 869, independent conditional: 0, independent unconditional: 869, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 889, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1093, independent: 203, independent conditional: 0, independent unconditional: 203, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 889, unknown conditional: 0, unknown unconditional: 889] , Statistics on independence cache: Total cache size (in pairs): 889, Positive cache size: 869, Positive conditional cache size: 0, Positive unconditional cache size: 869, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: 61 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 18, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 913, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1154, independent: 1072, independent conditional: 179, independent unconditional: 893, dependent: 82, dependent conditional: 62, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 179, independent unconditional: 893, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 179, independent unconditional: 893, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1093, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 889, independent: 869, independent conditional: 0, independent unconditional: 869, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 889, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1093, independent: 203, independent conditional: 0, independent unconditional: 203, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 889, unknown conditional: 0, unknown unconditional: 889] , Statistics on independence cache: Total cache size (in pairs): 889, Positive cache size: 869, Positive conditional cache size: 0, Positive unconditional cache size: 869, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: 61 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3717, independent: 3542, independent conditional: 616, independent unconditional: 2926, dependent: 175, dependent conditional: 129, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 616, independent unconditional: 2926, dependent: 50, dependent conditional: 4, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 616, independent unconditional: 2926, dependent: 50, dependent conditional: 4, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 0, independent unconditional: 3542, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 0, independent unconditional: 3542, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 0, independent unconditional: 3542, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2754, independent: 2708, independent conditional: 0, independent unconditional: 2708, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2754, independent: 2671, independent conditional: 0, independent unconditional: 2671, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3592, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2754, unknown conditional: 0, unknown unconditional: 2754] , Statistics on independence cache: Total cache size (in pairs): 2754, Positive cache size: 2708, Positive conditional cache size: 0, Positive unconditional cache size: 2708, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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: 125 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 35, Number of trivial persistent sets: 29, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2972, independent: 2926, independent conditional: 0, independent unconditional: 2926, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3717, independent: 3542, independent conditional: 616, independent unconditional: 2926, dependent: 175, dependent conditional: 129, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 616, independent unconditional: 2926, dependent: 50, dependent conditional: 4, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 616, independent unconditional: 2926, dependent: 50, dependent conditional: 4, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 0, independent unconditional: 3542, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 0, independent unconditional: 3542, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3592, independent: 3542, independent conditional: 0, independent unconditional: 3542, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2754, independent: 2708, independent conditional: 0, independent unconditional: 2708, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2754, independent: 2671, independent conditional: 0, independent unconditional: 2671, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3592, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2754, unknown conditional: 0, unknown unconditional: 2754] , Statistics on independence cache: Total cache size (in pairs): 2754, Positive cache size: 2708, Positive conditional cache size: 0, Positive unconditional cache size: 2708, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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: 125 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16314644, independent: 14683726, independent conditional: 14634847, independent unconditional: 48879, dependent: 1630918, dependent conditional: 1630387, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15040731, independent: 14683726, independent conditional: 14634847, independent unconditional: 48879, dependent: 357005, dependent conditional: 356474, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15040731, independent: 14683726, independent conditional: 14634847, independent unconditional: 48879, dependent: 357005, dependent conditional: 356474, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15454782, independent: 14683726, independent conditional: 4159051, independent unconditional: 10524675, dependent: 771056, dependent conditional: 493372, dependent unconditional: 277684, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15454782, independent: 14683726, independent conditional: 47580, independent unconditional: 14636146, dependent: 771056, dependent conditional: 61519, dependent unconditional: 709537, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15454782, independent: 14683726, independent conditional: 47580, independent unconditional: 14636146, dependent: 771056, dependent conditional: 61519, dependent unconditional: 709537, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27440, independent: 26571, independent conditional: 306, independent unconditional: 26265, dependent: 869, dependent conditional: 338, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27440, independent: 25827, independent conditional: 0, independent unconditional: 25827, dependent: 1613, dependent conditional: 0, dependent unconditional: 1613, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1613, independent: 744, independent conditional: 306, independent unconditional: 438, dependent: 869, dependent conditional: 338, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1613, independent: 744, independent conditional: 306, independent unconditional: 438, dependent: 869, dependent conditional: 338, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2608, independent: 1104, independent conditional: 611, independent unconditional: 493, dependent: 1504, dependent conditional: 830, dependent unconditional: 674, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15454782, independent: 14657155, independent conditional: 47274, independent unconditional: 14609881, dependent: 770187, dependent conditional: 61181, dependent unconditional: 709006, unknown: 27440, unknown conditional: 644, unknown unconditional: 26796] , Statistics on independence cache: Total cache size (in pairs): 27440, Positive cache size: 26571, Positive conditional cache size: 306, Positive unconditional cache size: 26265, Negative cache size: 869, Negative conditional cache size: 338, Negative unconditional cache size: 531, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4543324, Maximal queried relation: 2, Independence queries for same thread: 1273913 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 9.1s, Number of persistent set computation: 227130, Number of trivial persistent sets: 96294, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49410, independent: 48879, independent conditional: 0, independent unconditional: 48879, dependent: 531, dependent conditional: 0, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16314644, independent: 14683726, independent conditional: 14634847, independent unconditional: 48879, dependent: 1630918, dependent conditional: 1630387, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15040731, independent: 14683726, independent conditional: 14634847, independent unconditional: 48879, dependent: 357005, dependent conditional: 356474, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15040731, independent: 14683726, independent conditional: 14634847, independent unconditional: 48879, dependent: 357005, dependent conditional: 356474, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15454782, independent: 14683726, independent conditional: 4159051, independent unconditional: 10524675, dependent: 771056, dependent conditional: 493372, dependent unconditional: 277684, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15454782, independent: 14683726, independent conditional: 47580, independent unconditional: 14636146, dependent: 771056, dependent conditional: 61519, dependent unconditional: 709537, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15454782, independent: 14683726, independent conditional: 47580, independent unconditional: 14636146, dependent: 771056, dependent conditional: 61519, dependent unconditional: 709537, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27440, independent: 26571, independent conditional: 306, independent unconditional: 26265, dependent: 869, dependent conditional: 338, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27440, independent: 25827, independent conditional: 0, independent unconditional: 25827, dependent: 1613, dependent conditional: 0, dependent unconditional: 1613, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1613, independent: 744, independent conditional: 306, independent unconditional: 438, dependent: 869, dependent conditional: 338, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1613, independent: 744, independent conditional: 306, independent unconditional: 438, dependent: 869, dependent conditional: 338, dependent unconditional: 531, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2608, independent: 1104, independent conditional: 611, independent unconditional: 493, dependent: 1504, dependent conditional: 830, dependent unconditional: 674, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15454782, independent: 14657155, independent conditional: 47274, independent unconditional: 14609881, dependent: 770187, dependent conditional: 61181, dependent unconditional: 709006, unknown: 27440, unknown conditional: 644, unknown unconditional: 26796] , Statistics on independence cache: Total cache size (in pairs): 27440, Positive cache size: 26571, Positive conditional cache size: 306, Positive unconditional cache size: 26265, Negative cache size: 869, Negative conditional cache size: 338, Negative unconditional cache size: 531, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4543324, Maximal queried relation: 2, Independence queries for same thread: 1273913 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 98 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.4s, 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: 36, 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.3s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 281 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 363 ConstructedInterpolants, 23 QuantifiedInterpolants, 1372 SizeOfPredicates, 8 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 457/500 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 98 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 128 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 49/82 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 3 thread instances CFG has 5 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 105/138 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 128 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 90.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 18.5s, 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: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 68.5s InterpolantComputationTime, 631 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 899 ConstructedInterpolants, 154 QuantifiedInterpolants, 10742 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1968 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 960/1201 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread4of4ForFork0 with 1 thread instances CFG has 6 procedures, 188 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 392.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 370.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 73, 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.3s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 625 ConstructedInterpolants, 63 QuantifiedInterpolants, 21066 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1034 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 356/496 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