/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 00:49:55,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 00:49:56,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 00:49:56,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 00:49:56,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 00:49:56,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 00:49:56,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 00:49:56,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 00:49:56,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 00:49:56,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 00:49:56,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 00:49:56,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 00:49:56,075 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 00:49:56,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 00:49:56,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 00:49:56,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 00:49:56,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 00:49:56,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 00:49:56,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 00:49:56,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 00:49:56,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 00:49:56,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 00:49:56,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 00:49:56,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 00:49:56,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 00:49:56,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 00:49:56,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 00:49:56,080 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 00:49:56,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 00:49:56,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 00:49:56,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 00:49:56,082 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 00:49:56,083 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-08 00:49:56,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 00:49:56,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 00:49:56,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 00:49:56,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 00:49:56,353 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 00:49:56,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-08 00:49:57,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 00:49:57,794 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 00:49:57,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2024-05-08 00:49:57,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cc5e2dc7e/71a5152d363b4a399349bf40108ccc00/FLAG8923d120c [2024-05-08 00:49:57,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cc5e2dc7e/71a5152d363b4a399349bf40108ccc00 [2024-05-08 00:49:57,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 00:49:57,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 00:49:57,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 00:49:57,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 00:49:57,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 00:49:57,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 12:49:57" (1/1) ... [2024-05-08 00:49:57,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b319c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:57, skipping insertion in model container [2024-05-08 00:49:57,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 12:49:57" (1/1) ... [2024-05-08 00:49:57,881 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 00:49:58,156 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[31505,31518] [2024-05-08 00:49:58,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/pthread-atomic/szymanski.i[32915,32928] [2024-05-08 00:49:58,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 00:49:58,180 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 00:49:58,205 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[31505,31518] [2024-05-08 00:49:58,207 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i[32915,32928] [2024-05-08 00:49:58,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 00:49:58,231 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 00:49:58,231 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 00:49:58,237 INFO L206 MainTranslator]: Completed translation [2024-05-08 00:49:58,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58 WrapperNode [2024-05-08 00:49:58,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 00:49:58,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 00:49:58,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 00:49:58,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 00:49:58,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,269 INFO L138 Inliner]: procedures = 170, calls = 74, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2024-05-08 00:49:58,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 00:49:58,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 00:49:58,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 00:49:58,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 00:49:58,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 00:49:58,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 00:49:58,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 00:49:58,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 00:49:58,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (1/1) ... [2024-05-08 00:49:58,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 00:49:58,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:49:58,335 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-08 00:49:58,338 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-08 00:49:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 00:49:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-08 00:49:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-08 00:49:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-08 00:49:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 00:49:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 00:49:58,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 00:49:58,370 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 00:49:58,459 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 00:49:58,460 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 00:49:58,615 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 00:49:58,623 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 00:49:58,624 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2024-05-08 00:49:58,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 12:49:58 BoogieIcfgContainer [2024-05-08 00:49:58,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 00:49:58,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 00:49:58,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 00:49:58,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 00:49:58,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 12:49:57" (1/3) ... [2024-05-08 00:49:58,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3962de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 12:49:58, skipping insertion in model container [2024-05-08 00:49:58,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 12:49:58" (2/3) ... [2024-05-08 00:49:58,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3962de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 12:49:58, skipping insertion in model container [2024-05-08 00:49:58,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 12:49:58" (3/3) ... [2024-05-08 00:49:58,633 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-05-08 00:49:58,638 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 00:49:58,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 00:49:58,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-08 00:49:58,645 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 00:49:58,694 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-08 00:49:58,723 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 00:49:58,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 00:49:58,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:49:58,726 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-08 00:49:58,743 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-08 00:49:58,752 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 00:49:58,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:49:58,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 00:49:58,766 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;@61f114bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 00:49:58,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-08 00:49:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 623440169, now seen corresponding path program 1 times [2024-05-08 00:49:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:49:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:49:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-08 00:49:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-08 00:49:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 645532603, now seen corresponding path program 1 times [2024-05-08 00:49:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:49:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 00:49:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-08 00:49:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-08 00:49:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -521405355, now seen corresponding path program 1 times [2024-05-08 00:49:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 00:49:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 00:49:59,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-08 00:49:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-05-08 00:49:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 1 times [2024-05-08 00:49:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,910 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-08 00:49:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:49:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:49:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:49:59,996 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-08 00:50:00,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 00:50:00,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:50:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1561719619, now seen corresponding path program 1 times [2024-05-08 00:50:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:50:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789792718] [2024-05-08 00:50:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 00:50:00,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:50:00,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789792718] [2024-05-08 00:50:00,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789792718] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:50:00,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772905297] [2024-05-08 00:50:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:50:00,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:50:00,082 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-08 00:50:00,113 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-08 00:50:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-08 00:50:00,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:50:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 00:50:00,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-08 00:50:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772905297] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:50:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-08 00:50:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-08 00:50:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309243572] [2024-05-08 00:50:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:50:00,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 00:50:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:50:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 2 times [2024-05-08 00:50:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,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-08 00:50:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,272 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-08 00:50:00,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 00:50:00,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-08 00:50:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:50:00,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:50:00,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-08 00:50:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:50:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 3 times [2024-05-08 00:50:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,388 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-08 00:50:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,411 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-08 00:50:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:50:00,454 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-08 00:50:00,651 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,SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9 [2024-05-08 00:50:00,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 00:50:00,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 00:50:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash -214652225, now seen corresponding path program 1 times [2024-05-08 00:50:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 00:50:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548223354] [2024-05-08 00:50:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-08 00:50:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 00:50:00,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548223354] [2024-05-08 00:50:00,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548223354] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 00:50:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489987319] [2024-05-08 00:50:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 00:50:00,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 00:50:00,714 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-08 00:50:00,716 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-08 00:50:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-08 00:50:00,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 00:50:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 00:50:00,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-08 00:50:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489987319] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 00:50:00,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-08 00:50:00,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-08 00:50:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933949027] [2024-05-08 00:50:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 00:50:00,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 00:50:00,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 00:50:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 4 times [2024-05-08 00:50:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,871 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-08 00:50:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:00,947 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-08 00:50:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 00:50:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-08 00:50:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:50:00,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 00:50:00,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-08 00:50:00,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:50:00,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 00:50:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 5 times [2024-05-08 00:50:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,057 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-08 00:50:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,094 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-08 00:50:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1007501233, now seen corresponding path program 1 times [2024-05-08 00:50:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,294 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-08 00:50:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,321 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-08 00:50:01,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 00:50:01,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-05-08 00:50:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 1 times [2024-05-08 00:50:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 6 times [2024-05-08 00:50:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,560 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-08 00:50:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,579 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-08 00:50:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 1 times [2024-05-08 00:50:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 991567198, now seen corresponding path program 1 times [2024-05-08 00:50:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash -586650568, now seen corresponding path program 1 times [2024-05-08 00:50:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1006298031, now seen corresponding path program 1 times [2024-05-08 00:50:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,906 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-08 00:50:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,924 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-08 00:50:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash -684754539, now seen corresponding path program 1 times [2024-05-08 00:50:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:01,993 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-08 00:50:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:01,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,012 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-08 00:50:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash -919102792, now seen corresponding path program 1 times [2024-05-08 00:50:02,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,070 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-08 00:50:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,090 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-08 00:50:02,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1505491961, now seen corresponding path program 1 times [2024-05-08 00:50:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,148 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-08 00:50:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,166 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-08 00:50:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash 991609979, now seen corresponding path program 1 times [2024-05-08 00:50:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,230 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-08 00:50:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,245 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-08 00:50:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 00:50:02,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-05-08 00:50:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 301515513, now seen corresponding path program 2 times [2024-05-08 00:50:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 301543571, now seen corresponding path program 7 times [2024-05-08 00:50:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,458 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-08 00:50:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:02,503 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-08 00:50:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 2 times [2024-05-08 00:50:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 1 times [2024-05-08 00:50:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 1 times [2024-05-08 00:50:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 1 times [2024-05-08 00:50:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:02,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:03,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 1 times [2024-05-08 00:50:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:03,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:03,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1196573071, now seen corresponding path program 1 times [2024-05-08 00:50:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:03,651 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-08 00:50:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:03,669 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-08 00:50:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-08 00:50:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-05-08 00:50:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 3 times [2024-05-08 00:50:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:03,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 2 times [2024-05-08 00:50:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 2 times [2024-05-08 00:50:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 2 times [2024-05-08 00:50:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 2 times [2024-05-08 00:50:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:04,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 521659048, now seen corresponding path program 1 times [2024-05-08 00:50:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 1 times [2024-05-08 00:50:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2064881097, now seen corresponding path program 1 times [2024-05-08 00:50:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:05,520 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-08 00:50:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:05,538 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-08 00:50:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-08 00:50:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2024-05-08 00:50:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1007465487, now seen corresponding path program 4 times [2024-05-08 00:50:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 3 times [2024-05-08 00:50:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,935 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 3 times [2024-05-08 00:50:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:05,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 3 times [2024-05-08 00:50:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1376559096, now seen corresponding path program 3 times [2024-05-08 00:50:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 521659048, now seen corresponding path program 2 times [2024-05-08 00:50:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1196818038, now seen corresponding path program 2 times [2024-05-08 00:50:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2064882058, now seen corresponding path program 3 times [2024-05-08 00:50:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash -413165285, now seen corresponding path program 1 times [2024-05-08 00:50:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:06,889 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-08 00:50:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:06,958 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-08 00:50:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 00:50:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2024-05-08 00:50:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 654218827, now seen corresponding path program 4 times [2024-05-08 00:50:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:07,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -728194279, now seen corresponding path program 4 times [2024-05-08 00:50:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:07,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash 284977629, now seen corresponding path program 4 times [2024-05-08 00:50:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:07,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1809995054, now seen corresponding path program 1 times [2024-05-08 00:50:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:08,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1752067378, now seen corresponding path program 1 times [2024-05-08 00:50:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:08,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 109580726, now seen corresponding path program 1 times [2024-05-08 00:50:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:08,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1827261415, now seen corresponding path program 1 times [2024-05-08 00:50:09,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1529624573, now seen corresponding path program 1 times [2024-05-08 00:50:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1090409921, now seen corresponding path program 1 times [2024-05-08 00:50:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1160707340, now seen corresponding path program 1 times [2024-05-08 00:50:09,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash 149653968, now seen corresponding path program 1 times [2024-05-08 00:50:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:09,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:10,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2083552980, now seen corresponding path program 1 times [2024-05-08 00:50:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:10,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash -691870107, now seen corresponding path program 1 times [2024-05-08 00:50:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:10,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash 26863515, now seen corresponding path program 5 times [2024-05-08 00:50:10,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:10,755 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-08 00:50:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:10,770 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-08 00:50:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 00:50:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1197, Unknown=0, NotChecked=0, Total=1332 [2024-05-08 00:50:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -433211570, now seen corresponding path program 1 times [2024-05-08 00:50:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:15,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 00:50:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 00:50:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash -876939014, now seen corresponding path program 1 times [2024-05-08 00:50:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:15,311 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-08 00:50:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 00:50:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 00:50:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 00:50:15,327 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-08 00:50:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 00:50:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2024-05-08 00:50:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:50:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 00:50:18,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-08 00:50:18,478 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-08 00:50:18,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-08 00:50:18,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-08 00:50:18,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-08 00:50:18,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-08 00:50:18,499 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-08 00:50:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,SelfDestructingSolverStorable32,SelfDestructingSolverStorable76,SelfDestructingSolverStorable33,SelfDestructingSolverStorable77,SelfDestructingSolverStorable34,SelfDestructingSolverStorable78,SelfDestructingSolverStorable35,SelfDestructingSolverStorable79,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-08 00:50:18,684 INFO L448 BasicCegarLoop]: Path program histogram: [7, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-08 00:50:18,687 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 00:50:18,688 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 00:50:18,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 12:50:18 BasicIcfg [2024-05-08 00:50:18,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 00:50:18,691 INFO L158 Benchmark]: Toolchain (without parser) took 20871.39ms. Allocated memory was 253.8MB in the beginning and 702.5MB in the end (delta: 448.8MB). Free memory was 181.9MB in the beginning and 313.6MB in the end (delta: -131.7MB). Peak memory consumption was 317.8MB. Max. memory is 8.0GB. [2024-05-08 00:50:18,691 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 162.5MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 00:50:18,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.13ms. Allocated memory is still 253.8MB. Free memory was 181.6MB in the beginning and 161.0MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-08 00:50:18,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.40ms. Allocated memory is still 253.8MB. Free memory was 161.0MB in the beginning and 159.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 00:50:18,691 INFO L158 Benchmark]: Boogie Preprocessor took 18.21ms. Allocated memory is still 253.8MB. Free memory was 159.0MB in the beginning and 157.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-08 00:50:18,692 INFO L158 Benchmark]: RCFGBuilder took 313.81ms. Allocated memory is still 253.8MB. Free memory was 222.9MB in the beginning and 207.7MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-08 00:50:18,692 INFO L158 Benchmark]: TraceAbstraction took 20061.77ms. Allocated memory was 253.8MB in the beginning and 702.5MB in the end (delta: 448.8MB). Free memory was 206.6MB in the beginning and 313.6MB in the end (delta: -107.0MB). Peak memory consumption was 341.3MB. Max. memory is 8.0GB. [2024-05-08 00:50:18,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 162.5MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.13ms. Allocated memory is still 253.8MB. Free memory was 181.6MB in the beginning and 161.0MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.40ms. Allocated memory is still 253.8MB. Free memory was 161.0MB in the beginning and 159.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.21ms. Allocated memory is still 253.8MB. Free memory was 159.0MB in the beginning and 157.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.81ms. Allocated memory is still 253.8MB. Free memory was 222.9MB in the beginning and 207.7MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 20061.77ms. Allocated memory was 253.8MB in the beginning and 702.5MB in the end (delta: 448.8MB). Free memory was 206.6MB in the beginning and 313.6MB in the end (delta: -107.0MB). Peak memory consumption was 341.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45070, independent: 40552, independent conditional: 40251, independent unconditional: 301, dependent: 4518, dependent conditional: 4513, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42614, independent: 40552, independent conditional: 40251, independent unconditional: 301, dependent: 2062, dependent conditional: 2057, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42614, independent: 40552, independent conditional: 40251, independent unconditional: 301, dependent: 2062, dependent conditional: 2057, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42614, independent: 40552, independent conditional: 40251, independent unconditional: 301, dependent: 2062, dependent conditional: 2057, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50948, independent: 40552, independent conditional: 17770, independent unconditional: 22782, dependent: 10396, dependent conditional: 8336, dependent unconditional: 2060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50948, independent: 40552, independent conditional: 15231, independent unconditional: 25321, dependent: 10396, dependent conditional: 4429, dependent unconditional: 5967, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50948, independent: 40552, independent conditional: 15231, independent unconditional: 25321, dependent: 10396, dependent conditional: 4429, dependent unconditional: 5967, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2134, independent: 1784, independent conditional: 453, independent unconditional: 1331, dependent: 350, dependent conditional: 268, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2134, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 350, dependent conditional: 0, dependent unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 350, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 350, dependent conditional: 268, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 350, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 350, dependent conditional: 268, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 279, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 279, dependent conditional: 191, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 50948, independent: 38768, independent conditional: 14778, independent unconditional: 23990, dependent: 10046, dependent conditional: 4161, dependent unconditional: 5885, unknown: 2134, unknown conditional: 721, unknown unconditional: 1413] , Statistics on independence cache: Total cache size (in pairs): 2134, Positive cache size: 1784, Positive conditional cache size: 453, Positive unconditional cache size: 1331, Negative cache size: 350, Negative conditional cache size: 268, Negative unconditional cache size: 82, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6446, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50948, independent: 40552, independent conditional: 17770, independent unconditional: 22782, dependent: 10396, dependent conditional: 8336, dependent unconditional: 2060, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50948, independent: 40552, independent conditional: 15231, independent unconditional: 25321, dependent: 10396, dependent conditional: 4429, dependent unconditional: 5967, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50948, independent: 40552, independent conditional: 15231, independent unconditional: 25321, dependent: 10396, dependent conditional: 4429, dependent unconditional: 5967, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2134, independent: 1784, independent conditional: 453, independent unconditional: 1331, dependent: 350, dependent conditional: 268, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2134, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 350, dependent conditional: 0, dependent unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 350, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 350, dependent conditional: 268, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 350, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 350, dependent conditional: 268, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 279, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 279, dependent conditional: 191, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 50948, independent: 38768, independent conditional: 14778, independent unconditional: 23990, dependent: 10046, dependent conditional: 4161, dependent unconditional: 5885, unknown: 2134, unknown conditional: 721, unknown unconditional: 1413] , Statistics on independence cache: Total cache size (in pairs): 2134, Positive cache size: 1784, Positive conditional cache size: 453, Positive unconditional cache size: 1331, Negative cache size: 350, Negative conditional cache size: 268, Negative unconditional cache size: 82, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6446 ], Independence queries for same thread: 2456 - PositiveResult [Line: 802]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 745]: 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 5 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 18.9s, 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: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 49/52 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: 17.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 10, ConditionalCommutativityConditionCalculations: 415, ConditionalCommutativityTraceChecks: 60, ConditionalCommutativityImperfectProofs: 11 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-08 00:50:18,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-08 00:50:18,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...