/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 2 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 07:20:36,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 07:20:36,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 07:20:36,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 07:20:36,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 07:20:36,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 07:20:36,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 07:20:36,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 07:20:36,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 07:20:36,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 07:20:36,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 07:20:36,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 07:20:36,404 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 07:20:36,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 07:20:36,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 07:20:36,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 07:20:36,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 07:20:36,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 07:20:36,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 07:20:36,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 07:20:36,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 07:20:36,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 07:20:36,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 07:20:36,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 07:20:36,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 07:20:36,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 07:20:36,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 07:20:36,408 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 07:20:36,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 07:20:36,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 07:20:36,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 07:20:36,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 07:20:36,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 07:20:36,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 2 [2024-05-06 07:20:36,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 07:20:36,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 07:20:36,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 07:20:36,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 07:20:36,665 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 07:20:36,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-06 07:20:37,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 07:20:37,911 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 07:20:37,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2024-05-06 07:20:37,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4f4b46a7c/06624802fce7444bb8aea2842cee00d6/FLAG2a224c724 [2024-05-06 07:20:37,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4f4b46a7c/06624802fce7444bb8aea2842cee00d6 [2024-05-06 07:20:37,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 07:20:37,935 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 07:20:37,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 07:20:37,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 07:20:37,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 07:20:37,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 07:20:37" (1/1) ... [2024-05-06 07:20:37,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56de50e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:37, skipping insertion in model container [2024-05-06 07:20:37,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 07:20:37" (1/1) ... [2024-05-06 07:20:37,977 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 07:20:38,130 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2024-05-06 07:20:38,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 07:20:38,149 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 07:20:38,166 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2024-05-06 07:20:38,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 07:20:38,182 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 07:20:38,182 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 07:20:38,193 INFO L206 MainTranslator]: Completed translation [2024-05-06 07:20:38,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38 WrapperNode [2024-05-06 07:20:38,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 07:20:38,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 07:20:38,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 07:20:38,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 07:20:38,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,228 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 243 [2024-05-06 07:20:38,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 07:20:38,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 07:20:38,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 07:20:38,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 07:20:38,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 07:20:38,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 07:20:38,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 07:20:38,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 07:20:38,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (1/1) ... [2024-05-06 07:20:38,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 07:20:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 07:20:38,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 07:20:38,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 07:20:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 07:20:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 07:20:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 07:20:38,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 07:20:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 07:20:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 07:20:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 07:20:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-06 07:20:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 07:20:38,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 07:20:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 07:20:38,325 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 07:20:38,422 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 07:20:38,424 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 07:20:38,746 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 07:20:38,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 07:20:38,819 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2024-05-06 07:20:38,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 07:20:38 BoogieIcfgContainer [2024-05-06 07:20:38,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 07:20:38,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 07:20:38,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 07:20:38,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 07:20:38,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 07:20:37" (1/3) ... [2024-05-06 07:20:38,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f4da5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 07:20:38, skipping insertion in model container [2024-05-06 07:20:38,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:20:38" (2/3) ... [2024-05-06 07:20:38,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f4da5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 07:20:38, skipping insertion in model container [2024-05-06 07:20:38,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 07:20:38" (3/3) ... [2024-05-06 07:20:38,835 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2024-05-06 07:20:38,841 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 07:20:38,848 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 07:20:38,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 07:20:38,849 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 07:20:38,892 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-06 07:20:38,930 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 07:20:38,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 07:20:38,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 07:20:38,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 07:20:38,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 07:20:38,978 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 07:20:38,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 07:20:38,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 07:20:39,001 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;@35f3e7cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 07:20:39,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 07:20:39,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 07:20:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 07:20:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash 941376213, now seen corresponding path program 1 times [2024-05-06 07:20:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 07:20:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268209640] [2024-05-06 07:20:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:20:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 07:20:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268209640] [2024-05-06 07:20:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268209640] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 07:20:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 07:20:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 07:20:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228704754] [2024-05-06 07:20:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 07:20:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 07:20:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 07:20:39,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 07:20:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 07:20:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:39,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 07:20:39,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 07:20:39,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:39,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 07:20:39,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 07:20:39,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 07:20:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash -467458075, now seen corresponding path program 1 times [2024-05-06 07:20:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 07:20:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633382606] [2024-05-06 07:20:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:20:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 07:20:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633382606] [2024-05-06 07:20:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633382606] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 07:20:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 07:20:39,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 07:20:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639491408] [2024-05-06 07:20:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 07:20:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 07:20:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 07:20:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 07:20:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-06 07:20:39,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:39,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 07:20:39,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 07:20:39,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:39,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 07:20:40,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-06 07:20:40,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 07:20:40,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 07:20:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 120148031, now seen corresponding path program 1 times [2024-05-06 07:20:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 07:20:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958592271] [2024-05-06 07:20:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:20:41,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 07:20:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958592271] [2024-05-06 07:20:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958592271] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 07:20:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643444525] [2024-05-06 07:20:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 07:20:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 07:20:41,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 07:20:41,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 07:20:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:41,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 61 conjunts are in the unsatisfiable core [2024-05-06 07:20:41,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 07:20:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-06 07:20:41,573 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-06 07:20:41,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-05-06 07:20:41,935 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-06 07:20:41,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-05-06 07:20:42,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-06 07:20:42,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-06 07:20:43,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-06 07:20:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-06 07:20:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:20:43,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 07:20:43,634 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))))) (or (< c_~n~0 (+ .cse0 1)) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse0))) c_~i~0) (< .cse0 0))))) is different from false [2024-05-06 07:20:43,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (< .cse0 0) (< c_~n~0 (+ .cse0 1)) (< c_~n~0 (+ (select .cse1 (+ (* .cse0 4) c_~f~0.offset)) 2)))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1))))))) is different from false [2024-05-06 07:20:44,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) is different from false [2024-05-06 07:20:44,554 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2024-05-06 07:20:44,798 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-05-06 07:20:44,831 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~f~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (< c_~n~0 (+ 2 (select .cse0 (+ (* .cse1 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse1 1)) (< .cse1 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (< c_~n~0 (+ .cse3 1)) (< (select .cse4 (+ (* .cse3 4) c_~f~0.offset)) 1) (< .cse3 0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) is different from false [2024-05-06 07:20:48,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:20:48,934 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 130 treesize of output 94 [2024-05-06 07:20:48,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:20:48,946 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 1056 treesize of output 1012 [2024-05-06 07:20:48,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:20:48,984 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 480 treesize of output 404 [2024-05-06 07:20:49,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:20:49,028 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2024-05-06 07:20:49,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:20:49,057 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 175 [2024-05-06 07:20:49,827 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-06 07:20:49,828 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 128 treesize of output 1 [2024-05-06 07:20:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:20:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643444525] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 07:20:50,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 07:20:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 31, 28] total 73 [2024-05-06 07:20:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672195745] [2024-05-06 07:20:50,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 07:20:50,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-05-06 07:20:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 07:20:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-05-06 07:20:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3849, Unknown=59, NotChecked=810, Total=5256 [2024-05-06 07:20:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:50,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 07:20:50,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 5.890410958904109) internal successors, (430), 73 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 07:20:50,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:50,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 07:20:50,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:50,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~f~0.base)) (.cse14 (+ c_~f~0.offset (* c_~j~0 4)))) (let ((.cse0 (select .cse9 .cse14)) (.cse21 (and (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse27 (select .cse26 .cse14))) (or (< c_~n~0 (+ 2 (select .cse26 (+ (* .cse27 4) c_~f~0.offset)))) (< c_~n~0 (+ .cse27 1)) (< .cse27 0))))) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse28 (select .cse29 .cse14))) (or (< c_~n~0 (+ .cse28 1)) (< (select .cse29 (+ (* .cse28 4) c_~f~0.offset)) 1) (< .cse28 0))))))) (.cse5 (< c_~n~0 1)) (.cse6 (= c_~n~0 1))) (and (or (< c_~j~0 0) (< c_~n~0 (+ c_~j~0 1)) (= .cse0 c_~i~0)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse1 (select .cse2 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< c_~n~0 (+ .cse1 1)) (< .cse1 0) (< c_~n~0 (+ (select .cse2 (+ (* .cse1 4) c_~f~0.offset)) 2)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse3 0) (< c_~n~0 (+ .cse3 1)) (< c_~n~0 (+ (select .cse4 (+ (* .cse3 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 2)))))) (< c_~n~0 (+ ~i~0 1)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_8|) 0)))) .cse5 .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse8 (select .cse7 (+ (* ~i~0 4) c_~f~0.offset)))) (or (< (select .cse7 (+ (* .cse8 4) c_~f~0.offset)) 1) (< c_~n~0 (+ .cse8 1)) (< .cse8 0))))))) (or (< c_~n~0 (+ .cse0 1)) (< .cse0 0) (= c_~i~0 (select .cse9 (+ c_~f~0.offset (* .cse0 4))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse10 (select .cse11 (+ (* ~i~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (or (< .cse10 0) (< (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1) (< c_~n~0 (+ .cse10 1)))))))) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse13 (select .cse12 .cse14))) (or (< (select .cse12 (+ c_~f~0.offset (* 4 .cse13))) 1) (< c_~n~0 (+ .cse13 1)) (< .cse13 0))))) (or (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6) (forall ((~i~0 Int)) (or (< ~i~0 0) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse16 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse15 0) (< (select .cse16 (+ (* .cse15 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) (< c_~n~0 (+ .cse15 1)))))) (< c_~n~0 (+ ~i~0 1)))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse18 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse17 0) (< (select .cse18 (+ (* .cse17 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1) (< c_~n~0 (+ .cse17 1)))))))) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse20 (select .cse19 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~n~0 (+ 2 (select .cse19 (+ (* .cse20 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< .cse20 0) (< c_~n~0 (+ .cse20 1)))))))) (or .cse21 (< c_~i~0 0) (< c_~n~0 (+ c_~i~0 1))) (or .cse21 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (forall ((~i~0 Int)) (or (< ~i~0 0) (< c_~n~0 (+ ~i~0 1)) (forall ((v_ArrVal_66 (Array Int Int)) (v_ArrVal_64 (Array Int Int)) (v_ArrVal_65 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_64) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse23 (select .cse22 (+ (* ~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~n~0 (+ (select .cse22 (+ (* .cse23 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2)) (< .cse23 0) (< c_~n~0 (+ .cse23 1)))))))) (or .cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (forall ((v_ArrVal_66 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_66) c_~f~0.base))) (let ((.cse24 (select .cse25 .cse14))) (or (< c_~n~0 (+ .cse24 1)) (< c_~n~0 (+ (select .cse25 (+ c_~f~0.offset (* 4 .cse24))) 2)) (< .cse24 0)))))))) is different from false [2024-05-06 07:20:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 07:20:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-06 07:20:51,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 07:20:52,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-06 07:20:52,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 07:20:52,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 07:20:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1785299303, now seen corresponding path program 2 times [2024-05-06 07:20:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 07:20:52,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920353423] [2024-05-06 07:20:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:20:54,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 07:20:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920353423] [2024-05-06 07:20:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920353423] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 07:20:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365566523] [2024-05-06 07:20:54,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 07:20:54,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 07:20:54,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 07:20:54,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 07:20:54,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-06 07:20:54,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-05-06 07:20:54,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 07:20:54,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-06 07:20:54,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 07:20:54,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-06 07:20:54,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-06 07:20:54,597 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 [2024-05-06 07:20:55,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 07:20:55,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-05-06 07:20:55,264 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 28 treesize of output 21 [2024-05-06 07:20:55,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:20:55,361 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-05-06 07:20:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:20:55,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 07:20:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365566523] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 07:20:55,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 07:20:55,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [32] total 48 [2024-05-06 07:20:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194638148] [2024-05-06 07:20:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 07:20:55,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-06 07:20:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 07:20:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-06 07:20:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2024-05-06 07:20:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:55,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 07:20:55,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 07:20:55,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:55,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 07:20:55,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-06 07:20:55,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:20:56,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-05-06 07:20:57,073 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:20:57,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:20:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash 608404265, now seen corresponding path program 1 times [2024-05-06 07:20:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:57,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:20:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:57,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-05-06 07:20:57,357 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:20:57,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:20:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2078801557, now seen corresponding path program 1 times [2024-05-06 07:20:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:57,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:20:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:57,626 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 07:20:57,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2024-05-06 07:20:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash -346215198, now seen corresponding path program 1 times [2024-05-06 07:20:57,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:20:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:20:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 07:20:58,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-06 07:20:58,871 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:20:58,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:20:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash -957694256, now seen corresponding path program 1 times [2024-05-06 07:20:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:59,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:20:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1948868702, now seen corresponding path program 1 times [2024-05-06 07:20:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:59,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:20:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:20:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2070285016, now seen corresponding path program 1 times [2024-05-06 07:20:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:59,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:20:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:20:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:20:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:20:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:20:59,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 07:20:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-05-06 07:21:00,211 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:21:00,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:21:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash -957694256, now seen corresponding path program 2 times [2024-05-06 07:21:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:00,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:21:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:00,598 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:21:00,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:21:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1948868702, now seen corresponding path program 2 times [2024-05-06 07:21:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:00,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:21:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:00,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-05-06 07:21:01,081 INFO L85 PathProgramCache]: Analyzing trace with hash -859758043, now seen corresponding path program 2 times [2024-05-06 07:21:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:01,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:21:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:01,351 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 07:21:01,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2024-05-06 07:21:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash -882687262, now seen corresponding path program 2 times [2024-05-06 07:21:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 07:21:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-05-06 07:21:02,736 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 07:21:02,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-06 07:21:02,906 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:21:02,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:21:03,223 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:21:03,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:21:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1768923945, now seen corresponding path program 1 times [2024-05-06 07:21:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:03,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 07:21:03,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2024-05-06 07:21:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash 109054638, now seen corresponding path program 1 times [2024-05-06 07:21:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:03,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:03,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 07:21:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 07:21:04,181 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-06 07:21:04,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-06 07:21:04,310 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:21:04,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:21:04,651 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 07:21:04,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 07:21:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1888788359, now seen corresponding path program 2 times [2024-05-06 07:21:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:06,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 07:21:06,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1444, Unknown=1, NotChecked=0, Total=1640 [2024-05-06 07:21:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:21:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 07:21:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-06 07:21:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-06 07:21:07,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-06 07:21:07,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 07:21:07,747 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 07:21:07,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 07:21:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 365871679, now seen corresponding path program 3 times [2024-05-06 07:21:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 07:21:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451196274] [2024-05-06 07:21:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 07:21:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 07:21:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 07:21:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 07:21:08,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 07:21:08,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451196274] [2024-05-06 07:21:08,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451196274] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 07:21:08,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304115382] [2024-05-06 07:21:08,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 07:21:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 07:21:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 07:21:08,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 07:21:08,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-06 07:21:09,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-05-06 07:21:09,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 07:21:09,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-06 07:21:09,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 07:21:09,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-06 07:21:09,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-06 07:21:09,118 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 [2024-05-06 07:21:09,612 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 28 treesize of output 21 [2024-05-06 07:21:09,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 07:21:09,707 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-05-06 07:21:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-06 07:21:09,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-06 07:21:09,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304115382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 07:21:09,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-06 07:21:09,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [30] total 44 [2024-05-06 07:21:09,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400673475] [2024-05-06 07:21:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 07:21:09,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-06 07:21:09,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 07:21:09,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-06 07:21:09,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1761, Unknown=0, NotChecked=0, Total=1892 [2024-05-06 07:21:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:21:09,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 07:21:09,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.3) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 07:21:09,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:21:09,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 07:21:09,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-06 07:21:09,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-06 07:21:09,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:21:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 07:21:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-06 07:21:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-06 07:21:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-06 07:21:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-06 07:21:16,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 07:21:16,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 07:21:16,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 07:21:16,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 07:21:16,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-06 07:21:16,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 07:21:16,221 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-05-06 07:21:16,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 07:21:16,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 07:21:16,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 07:21:16 BasicIcfg [2024-05-06 07:21:16,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 07:21:16,226 INFO L158 Benchmark]: Toolchain (without parser) took 38290.67ms. Allocated memory was 275.8MB in the beginning and 954.2MB in the end (delta: 678.4MB). Free memory was 204.8MB in the beginning and 733.4MB in the end (delta: -528.6MB). Peak memory consumption was 152.1MB. Max. memory is 8.0GB. [2024-05-06 07:21:16,226 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 275.8MB. Free memory is still 243.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 07:21:16,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.66ms. Allocated memory is still 275.8MB. Free memory was 204.6MB in the beginning and 192.2MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-06 07:21:16,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 275.8MB. Free memory was 192.0MB in the beginning and 189.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 07:21:16,226 INFO L158 Benchmark]: Boogie Preprocessor took 27.38ms. Allocated memory is still 275.8MB. Free memory was 189.8MB in the beginning and 188.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 07:21:16,226 INFO L158 Benchmark]: RCFGBuilder took 563.21ms. Allocated memory is still 275.8MB. Free memory was 188.0MB in the beginning and 227.3MB in the end (delta: -39.3MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2024-05-06 07:21:16,227 INFO L158 Benchmark]: TraceAbstraction took 37403.42ms. Allocated memory was 275.8MB in the beginning and 954.2MB in the end (delta: 678.4MB). Free memory was 225.7MB in the beginning and 733.4MB in the end (delta: -507.7MB). Peak memory consumption was 171.5MB. Max. memory is 8.0GB. [2024-05-06 07:21:16,228 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 275.8MB. Free memory is still 243.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.66ms. Allocated memory is still 275.8MB. Free memory was 204.6MB in the beginning and 192.2MB in the end (delta: 12.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 275.8MB. Free memory was 192.0MB in the beginning and 189.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.38ms. Allocated memory is still 275.8MB. Free memory was 189.8MB in the beginning and 188.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 563.21ms. Allocated memory is still 275.8MB. Free memory was 188.0MB in the beginning and 227.3MB in the end (delta: -39.3MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * TraceAbstraction took 37403.42ms. Allocated memory was 275.8MB in the beginning and 954.2MB in the end (delta: 678.4MB). Free memory was 225.7MB in the beginning and 733.4MB in the end (delta: -507.7MB). Peak memory consumption was 171.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 185037, independent: 184843, independent conditional: 184756, independent unconditional: 87, dependent: 194, dependent conditional: 194, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 184954, independent: 184843, independent conditional: 184756, independent unconditional: 87, dependent: 111, dependent conditional: 111, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 184954, independent: 184843, independent conditional: 184756, independent unconditional: 87, dependent: 111, dependent conditional: 111, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 184954, independent: 184843, independent conditional: 184756, independent unconditional: 87, dependent: 111, dependent conditional: 111, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185650, independent: 184843, independent conditional: 90076, independent unconditional: 94767, dependent: 807, dependent conditional: 533, dependent unconditional: 274, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185650, independent: 184843, independent conditional: 53708, independent unconditional: 131135, dependent: 807, dependent conditional: 156, dependent unconditional: 651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185650, independent: 184843, independent conditional: 53708, independent unconditional: 131135, dependent: 807, dependent conditional: 156, dependent unconditional: 651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1144, independent: 1102, independent conditional: 355, independent unconditional: 747, dependent: 42, dependent conditional: 24, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1144, independent: 1084, independent conditional: 0, independent unconditional: 1084, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 60, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 42, dependent conditional: 24, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 42, dependent conditional: 24, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 56, dependent conditional: 39, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 185650, independent: 183741, independent conditional: 53353, independent unconditional: 130388, dependent: 765, dependent conditional: 132, dependent unconditional: 633, unknown: 1144, unknown conditional: 379, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1102, Positive conditional cache size: 355, Positive unconditional cache size: 747, Negative cache size: 42, Negative conditional cache size: 24, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36745, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185650, independent: 184843, independent conditional: 90076, independent unconditional: 94767, dependent: 807, dependent conditional: 533, dependent unconditional: 274, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185650, independent: 184843, independent conditional: 53708, independent unconditional: 131135, dependent: 807, dependent conditional: 156, dependent unconditional: 651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185650, independent: 184843, independent conditional: 53708, independent unconditional: 131135, dependent: 807, dependent conditional: 156, dependent unconditional: 651, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1144, independent: 1102, independent conditional: 355, independent unconditional: 747, dependent: 42, dependent conditional: 24, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1144, independent: 1084, independent conditional: 0, independent unconditional: 1084, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 60, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 42, dependent conditional: 24, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 42, dependent conditional: 24, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 56, dependent conditional: 39, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 185650, independent: 183741, independent conditional: 53353, independent unconditional: 130388, dependent: 765, dependent conditional: 132, dependent unconditional: 633, unknown: 1144, unknown conditional: 379, unknown unconditional: 765] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1102, Positive conditional cache size: 355, Positive unconditional cache size: 747, Negative cache size: 42, Negative conditional cache size: 24, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36745 ], Independence queries for same thread: 83 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 220 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 20.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: 125, 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.5s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1317 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1506 ConstructedInterpolants, 88 QuantifiedInterpolants, 23114 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1043 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 20/43 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 9.4s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 5, ConditionalCommutativityConditionCalculations: 22, ConditionalCommutativityTraceChecks: 13, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 07:21:16,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 07:21:16,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...