/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --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/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 15:24:30,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 15:24:30,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 15:24:30,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 15:24:30,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 15:24:30,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 15:24:30,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 15:24:30,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 15:24:30,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 15:24:30,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 15:24:30,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 15:24:30,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 15:24:30,178 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 15:24:30,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 15:24:30,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 15:24:30,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 15:24:30,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 15:24:30,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 15:24:30,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 15:24:30,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 15:24:30,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 15:24:30,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 15:24:30,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 15:24:30,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 15:24:30,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 15:24:30,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 15:24:30,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 15:24:30,188 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 15:24:30,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 15:24:30,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 15:24:30,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 15:24:30,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 15:24:30,191 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 15:24:30,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 15:24:30,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 15:24:30,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 15:24:30,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 15:24:30,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 15:24:30,427 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 15:24:30,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-07 15:24:31,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 15:24:31,751 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 15:24:31,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2024-05-07 15:24:31,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5d6e64059/79fcd301d7814904864542bb68f68193/FLAGf0ebb5f63 [2024-05-07 15:24:31,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5d6e64059/79fcd301d7814904864542bb68f68193 [2024-05-07 15:24:31,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 15:24:31,780 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 15:24:31,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 15:24:31,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 15:24:31,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 15:24:31,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:31,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ad2be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31, skipping insertion in model container [2024-05-07 15:24:31,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:31,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 15:24:31,939 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3373,3386] [2024-05-07 15:24:31,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 15:24:31,952 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 15:24:31,971 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3373,3386] [2024-05-07 15:24:31,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 15:24:31,979 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 15:24:31,979 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 15:24:31,985 INFO L206 MainTranslator]: Completed translation [2024-05-07 15:24:31,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31 WrapperNode [2024-05-07 15:24:31,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 15:24:31,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 15:24:31,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 15:24:31,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 15:24:31,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,015 INFO L138 Inliner]: procedures = 24, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-05-07 15:24:32,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 15:24:32,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 15:24:32,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 15:24:32,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 15:24:32,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 15:24:32,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 15:24:32,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 15:24:32,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 15:24:32,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (1/1) ... [2024-05-07 15:24:32,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 15:24:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 15:24:32,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 15:24:32,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 15:24:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 15:24:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 15:24:32,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 15:24:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 15:24:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 15:24:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-07 15:24:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-07 15:24:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-07 15:24:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-07 15:24:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 15:24:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 15:24:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 15:24:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 15:24:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 15:24:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 15:24:32,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 15:24:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 15:24:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 15:24:32,112 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 15:24:32,198 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 15:24:32,200 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 15:24:32,375 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 15:24:32,443 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 15:24:32,443 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-07 15:24:32,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 03:24:32 BoogieIcfgContainer [2024-05-07 15:24:32,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 15:24:32,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 15:24:32,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 15:24:32,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 15:24:32,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 03:24:31" (1/3) ... [2024-05-07 15:24:32,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c2113a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 03:24:32, skipping insertion in model container [2024-05-07 15:24:32,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 03:24:31" (2/3) ... [2024-05-07 15:24:32,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c2113a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 03:24:32, skipping insertion in model container [2024-05-07 15:24:32,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 03:24:32" (3/3) ... [2024-05-07 15:24:32,451 INFO L112 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2024-05-07 15:24:32,458 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 15:24:32,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 15:24:32,487 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 15:24:32,488 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 15:24:32,608 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-07 15:24:32,654 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 15:24:32,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 15:24:32,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 15:24:32,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 15:24:32,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 15:24:32,712 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 15:24:32,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:24:32,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 15:24:32,735 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;@388ac904, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 15:24:32,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 15:24:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash -886431304, now seen corresponding path program 1 times [2024-05-07 15:24:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-07 15:24:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:33,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-07 15:24:33,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 15:24:33,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 15:24:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash -757807902, now seen corresponding path program 1 times [2024-05-07 15:24:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash -561840913, now seen corresponding path program 2 times [2024-05-07 15:24:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:35,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -237198741, now seen corresponding path program 3 times [2024-05-07 15:24:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:36,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1506728072, now seen corresponding path program 4 times [2024-05-07 15:24:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:37,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -506553769, now seen corresponding path program 1 times [2024-05-07 15:24:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash 537848877, now seen corresponding path program 2 times [2024-05-07 15:24:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1972067691, now seen corresponding path program 1 times [2024-05-07 15:24:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1449088385, now seen corresponding path program 2 times [2024-05-07 15:24:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash -533211762, now seen corresponding path program 1 times [2024-05-07 15:24:44,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:44,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:45,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash 650304940, now seen corresponding path program 2 times [2024-05-07 15:24:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:47,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1891059467, now seen corresponding path program 3 times [2024-05-07 15:24:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1506698281, now seen corresponding path program 4 times [2024-05-07 15:24:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:24:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1246107416, now seen corresponding path program 5 times [2024-05-07 15:24:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash 513992292, now seen corresponding path program 6 times [2024-05-07 15:24:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1246107754, now seen corresponding path program 7 times [2024-05-07 15:24:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:51,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash 766213304, now seen corresponding path program 8 times [2024-05-07 15:24:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:51,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221779, now seen corresponding path program 9 times [2024-05-07 15:24:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:52,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:52,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1906526487, now seen corresponding path program 10 times [2024-05-07 15:24:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:52,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1027221441, now seen corresponding path program 11 times [2024-05-07 15:24:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:52,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1490250412, now seen corresponding path program 12 times [2024-05-07 15:24:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:53,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1891590048, now seen corresponding path program 13 times [2024-05-07 15:24:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:53,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:24:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:24:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash -176017754, now seen corresponding path program 1 times [2024-05-07 15:24:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1047677187, now seen corresponding path program 2 times [2024-05-07 15:24:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:55,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1047679202, now seen corresponding path program 1 times [2024-05-07 15:24:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:24:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:24:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:24:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:24:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:00,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1047679360, now seen corresponding path program 2 times [2024-05-07 15:25:00,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:00,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1914725122, now seen corresponding path program 1 times [2024-05-07 15:25:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1891591009, now seen corresponding path program 2 times [2024-05-07 15:25:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1674660496, now seen corresponding path program 14 times [2024-05-07 15:25:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:04,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1890967219, now seen corresponding path program 15 times [2024-05-07 15:25:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:05,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:05,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1013758434, now seen corresponding path program 16 times [2024-05-07 15:25:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:06,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -735708753, now seen corresponding path program 17 times [2024-05-07 15:25:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2059021066, now seen corresponding path program 18 times [2024-05-07 15:25:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:08,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 343907001, now seen corresponding path program 19 times [2024-05-07 15:25:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:08,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 589874355, now seen corresponding path program 20 times [2024-05-07 15:25:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:08,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1106236223, now seen corresponding path program 21 times [2024-05-07 15:25:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash 448343848, now seen corresponding path program 22 times [2024-05-07 15:25:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash -545293969, now seen corresponding path program 23 times [2024-05-07 15:25:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 275756523, now seen corresponding path program 24 times [2024-05-07 15:25:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1209477454, now seen corresponding path program 25 times [2024-05-07 15:25:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1054873290, now seen corresponding path program 26 times [2024-05-07 15:25:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1658665992, now seen corresponding path program 27 times [2024-05-07 15:25:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:09,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1509557972, now seen corresponding path program 28 times [2024-05-07 15:25:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:10,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1351352461, now seen corresponding path program 29 times [2024-05-07 15:25:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:10,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 710273648, now seen corresponding path program 1 times [2024-05-07 15:25:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:25:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:25:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash -533930189, now seen corresponding path program 2 times [2024-05-07 15:25:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1392112117, now seen corresponding path program 1 times [2024-05-07 15:25:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:25:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:25:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -207484270, now seen corresponding path program 2 times [2024-05-07 15:25:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 15:25:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1723310120, now seen corresponding path program 3 times [2024-05-07 15:25:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:24,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1838982731, now seen corresponding path program 30 times [2024-05-07 15:25:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:26,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 458730245, now seen corresponding path program 31 times [2024-05-07 15:25:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1335736101, now seen corresponding path program 32 times [2024-05-07 15:25:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 289099156, now seen corresponding path program 33 times [2024-05-07 15:25:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1101994567, now seen corresponding path program 34 times [2024-05-07 15:25:28,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1685215135, now seen corresponding path program 35 times [2024-05-07 15:25:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1588335903, now seen corresponding path program 1 times [2024-05-07 15:25:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1117990375, now seen corresponding path program 2 times [2024-05-07 15:25:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:32,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1205434021, now seen corresponding path program 1 times [2024-05-07 15:25:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 15:25:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1076806649, now seen corresponding path program 1 times [2024-05-07 15:25:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:36,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash 60659382, now seen corresponding path program 2 times [2024-05-07 15:25:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:37,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 15:25:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 15:25:37,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 15:25:37,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:25:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash 851921736, now seen corresponding path program 1 times [2024-05-07 15:25:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 15:25:37,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378263360] [2024-05-07 15:25:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-05-07 15:25:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 15:25:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378263360] [2024-05-07 15:25:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378263360] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 15:25:37,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 15:25:37,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 15:25:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402390980] [2024-05-07 15:25:37,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 15:25:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 15:25:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 15:25:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 15:25:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-07 15:25:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:37,443 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 15:25:37,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 15:25:37,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:37,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-05-07 15:25:37,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 15:25:37,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:25:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2029386885, now seen corresponding path program 2 times [2024-05-07 15:25:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 15:25:37,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145859714] [2024-05-07 15:25:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-05-07 15:25:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 15:25:38,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145859714] [2024-05-07 15:25:38,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145859714] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 15:25:38,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326031198] [2024-05-07 15:25:38,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 15:25:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:25:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 15:25:38,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 15:25:38,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 15:25:38,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 15:25:38,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 15:25:38,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-07 15:25:38,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 15:25:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-05-07 15:25:38,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 15:25:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326031198] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 15:25:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 15:25:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-05-07 15:25:38,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548183529] [2024-05-07 15:25:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 15:25:38,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-07 15:25:38,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 15:25:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 15:25:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-07 15:25:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:38,505 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 15:25:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 15:25:38,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:38,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:25:39,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-07 15:25:39,295 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,SelfDestructingSolverStorable86 [2024-05-07 15:25:39,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 15:25:39,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:25:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -10387549, now seen corresponding path program 3 times [2024-05-07 15:25:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 15:25:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544054263] [2024-05-07 15:25:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-07 15:25:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 15:25:39,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544054263] [2024-05-07 15:25:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544054263] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 15:25:39,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4674900] [2024-05-07 15:25:39,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-07 15:25:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:25:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 15:25:39,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 15:25:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 15:25:39,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-07 15:25:39,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 15:25:39,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-07 15:25:39,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 15:25:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-05-07 15:25:39,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 15:25:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 183 proven. 11 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-05-07 15:25:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4674900] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 15:25:40,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 15:25:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 15 [2024-05-07 15:25:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694657965] [2024-05-07 15:25:40,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 15:25:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-07 15:25:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 15:25:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-07 15:25:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-05-07 15:25:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:40,041 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 15:25:40,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 15:25:40,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:40,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:25:40,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:25:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 15:25:41,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-07 15:25:41,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:25:41,224 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 15:25:41,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:25:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -466662140, now seen corresponding path program 4 times [2024-05-07 15:25:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 15:25:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637900180] [2024-05-07 15:25:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-05-07 15:25:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 15:25:41,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637900180] [2024-05-07 15:25:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637900180] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 15:25:41,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 15:25:41,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-07 15:25:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50890080] [2024-05-07 15:25:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 15:25:41,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-07 15:25:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 15:25:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 15:25:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-07 15:25:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:41,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 15:25:41,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 15:25:41,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:41,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:25:41,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 15:25:41,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:25:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 15:25:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 15:25:43,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-05-07 15:25:43,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 15:25:43,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:25:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -552899893, now seen corresponding path program 5 times [2024-05-07 15:25:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 15:25:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927949717] [2024-05-07 15:25:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:25:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:25:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:25:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 93 proven. 180 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 15:25:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 15:25:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927949717] [2024-05-07 15:25:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927949717] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 15:25:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453763023] [2024-05-07 15:25:46,420 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-07 15:25:46,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:25:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 15:25:46,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 15:25:46,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-07 15:25:46,633 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-05-07 15:25:46,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 15:25:46,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 61 conjunts are in the unsatisfiable core [2024-05-07 15:25:46,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 15:25:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 42 proven. 231 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-07 15:25:52,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 15:25:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 85 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:25:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453763023] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 15:25:54,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 15:25:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 48] total 124 [2024-05-07 15:25:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817281827] [2024-05-07 15:25:54,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 15:25:54,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2024-05-07 15:25:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 15:25:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2024-05-07 15:25:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3495, Invalid=11757, Unknown=0, NotChecked=0, Total=15252 [2024-05-07 15:25:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:25:54,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 15:25:54,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 3.3548387096774195) internal successors, (416), 124 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 15:25:54,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:25:54,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:25:54,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 15:25:54,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 15:25:54,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:26:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:26:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:26:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-07 15:26:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 15:26:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2024-05-07 15:26:47,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-07 15:26:48,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:26:48,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 15:26:48,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 15:26:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1659990355, now seen corresponding path program 6 times [2024-05-07 15:26:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 15:26:48,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189575014] [2024-05-07 15:26:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 15:26:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 15:26:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 15:27:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 8 proven. 477 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-07 15:27:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 15:27:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189575014] [2024-05-07 15:27:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189575014] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 15:27:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612531729] [2024-05-07 15:27:02,133 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-07 15:27:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:27:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 15:27:02,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 15:27:02,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-07 15:27:02,648 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-05-07 15:27:02,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 15:27:02,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 100 conjunts are in the unsatisfiable core [2024-05-07 15:27:02,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 15:27:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 15 proven. 481 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-07 15:27:22,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 15:31:58,585 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 15:32:14,111 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 187 DAG size of output: 186 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 15:32:40,855 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 15:35:58,306 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 183 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-07 15:37:15,389 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (= c_~n2~0 25))) (let ((.cse7 (< c_~n2~0 24)) (.cse5 (not (= c_~n2~0 27))) (.cse4 (< 26 c_~n2~0)) (.cse6 (< c_~n2~0 26)) (.cse1 (not .cse2)) (.cse3 (< 25 c_~n2~0)) (.cse0 (not (= 22 c_~n2~0)))) (and (or (and (or (forall ((~m~0 Int)) (= (+ ~m~0 (* (div (+ (* 22 ~m~0) c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ c_~p1~0 (* 23 ~m~0)) 4294967296) 4294967296) c_~p2~0))) .cse0) (or (and (or (and (or (forall ((~m~0 Int)) (= (+ (* (div (+ c_~p1~0 (* 23 ~m~0)) 4294967296) 4294967296) (* 2 ~m~0) c_~p2~0) (+ (* (div (+ (* ~m~0 25) c_~p2~0) 4294967296) 4294967296) c_~p1~0))) .cse1) (or (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 24) c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ c_~p1~0 (* 23 ~m~0)) 4294967296) 4294967296) ~m~0 c_~p2~0))) .cse2)) .cse3) (or (and (or .cse4 (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 26) c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ c_~p1~0 (* 23 ~m~0)) 4294967296) 4294967296) (* 3 ~m~0) c_~p2~0)))) (or .cse5 (forall ((~m~0 Int)) (= (+ c_~p1~0 (* (div (+ (* ~m~0 27) c_~p2~0) 4294967296) 4294967296)) (+ (* (div (+ c_~p1~0 (* 23 ~m~0)) 4294967296) 4294967296) (* ~m~0 4) c_~p2~0))))) .cse6)) .cse7)) (not (= 23 c_~n1~0))) (or (not (= 25 c_~n1~0)) (and (or (and (or (and (or (forall ((~m~0 Int)) (let ((.cse8 (* ~m~0 25))) (= (+ (* 4294967296 (div (+ .cse8 c_~p1~0) 4294967296)) c_~p2~0) (+ (* (div (+ .cse8 c_~p2~0) 4294967296) 4294967296) c_~p1~0)))) .cse1) (or (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 24) c_~p2~0) 4294967296) 4294967296) ~m~0 c_~p1~0) (+ (* 4294967296 (div (+ (* ~m~0 25) c_~p1~0) 4294967296)) c_~p2~0))) .cse2)) .cse3) (or (and (or .cse4 (forall ((~m~0 Int)) (= (+ (* 4294967296 (div (+ (* ~m~0 25) c_~p1~0) 4294967296)) ~m~0 c_~p2~0) (+ (* (div (+ (* ~m~0 26) c_~p2~0) 4294967296) 4294967296) c_~p1~0)))) (or .cse5 (forall ((~m~0 Int)) (= (+ (* 4294967296 (div (+ (* ~m~0 25) c_~p1~0) 4294967296)) (* 2 ~m~0) c_~p2~0) (+ c_~p1~0 (* (div (+ (* ~m~0 27) c_~p2~0) 4294967296) 4294967296)))))) .cse6)) .cse7) (or (forall ((~m~0 Int)) (= (+ (* 3 ~m~0) (* (div (+ (* 22 ~m~0) c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* 4294967296 (div (+ (* ~m~0 25) c_~p1~0) 4294967296)) c_~p2~0))) .cse0))) (or (not (= 26 c_~n1~0)) (and (or (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 26) c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ (* ~m~0 4) (* (div (+ (* 22 ~m~0) c_~p2~0) 4294967296) 4294967296) c_~p1~0))) .cse0) (or .cse7 (and (or .cse6 (and (or .cse4 (forall ((~m~0 Int)) (let ((.cse9 (* ~m~0 26))) (= (+ (* (div (+ .cse9 c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ (* (div (+ .cse9 c_~p2~0) 4294967296) 4294967296) c_~p1~0))))) (or .cse5 (forall ((~m~0 Int)) (= (+ ~m~0 (* (div (+ (* ~m~0 26) c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ c_~p1~0 (* (div (+ (* ~m~0 27) c_~p2~0) 4294967296) 4294967296))))))) (or (and (or (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 26) c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ ~m~0 (* (div (+ (* ~m~0 25) c_~p2~0) 4294967296) 4294967296) c_~p1~0))) .cse1) (or (forall ((~m~0 Int)) (= (+ (* 2 ~m~0) (* (div (+ (* ~m~0 24) c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ (* ~m~0 26) c_~p1~0) 4294967296) 4294967296) c_~p2~0))) .cse2)) .cse3))))) (or (not (= c_~n1~0 27)) (and (or .cse7 (and (or (and (or (forall ((~m~0 Int)) (let ((.cse10 (* ~m~0 27))) (= (+ (* (div (+ .cse10 c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ c_~p1~0 (* (div (+ .cse10 c_~p2~0) 4294967296) 4294967296))))) .cse5) (or .cse4 (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 27) c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ (* (div (+ (* ~m~0 26) c_~p2~0) 4294967296) 4294967296) ~m~0 c_~p1~0))))) .cse6) (or (and (or (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 27) c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ (* 2 ~m~0) (* (div (+ (* ~m~0 25) c_~p2~0) 4294967296) 4294967296) c_~p1~0))) .cse1) (or (forall ((~m~0 Int)) (= (+ (* (div (+ (* ~m~0 27) c_~p1~0) 4294967296) 4294967296) c_~p2~0) (+ (* (div (+ (* ~m~0 24) c_~p2~0) 4294967296) 4294967296) (* 3 ~m~0) c_~p1~0))) .cse2)) .cse3))) (or (forall ((~m~0 Int)) (= (+ (* 5 ~m~0) (* (div (+ (* 22 ~m~0) c_~p2~0) 4294967296) 4294967296) c_~p1~0) (+ (* (div (+ (* ~m~0 27) c_~p1~0) 4294967296) 4294967296) c_~p2~0))) .cse0)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2024-05-07 15:37:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 495 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 15:37:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612531729] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 15:37:26,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 15:37:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 68, 74] total 184 [2024-05-07 15:37:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706073114] [2024-05-07 15:37:26,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 15:37:26,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 184 states [2024-05-07 15:37:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 15:37:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2024-05-07 15:37:26,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5489, Invalid=27767, Unknown=54, NotChecked=362, Total=33672 [2024-05-07 15:37:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:37:26,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 15:37:26,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 184 states, 184 states have (on average 2.7717391304347827) internal successors, (510), 184 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 15:37:26,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 15:37:26,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-07 15:37:26,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-07 15:37:26,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 15:37:26,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 393 states. [2024-05-07 15:37:26,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 15:37:36,707 WARN L293 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 469 DAG size of output: 129 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-07 15:38:27,231 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 15:38:27,248 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 15:38:27,278 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-07 15:38:27,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-07 15:38:27,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 15:38:27,555 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-4-3-3-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2024-05-07 15:38:27,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 15:38:27,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-07 15:38:27,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 15:38:27,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 15:38:27,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-07 15:38:27,561 INFO L448 BasicCegarLoop]: Path program histogram: [35, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2024-05-07 15:38:27,563 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 15:38:27,563 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 15:38:27,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 03:38:27 BasicIcfg [2024-05-07 15:38:27,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 15:38:27,565 INFO L158 Benchmark]: Toolchain (without parser) took 835784.56ms. Allocated memory was 304.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 234.5MB in the beginning and 1.2GB in the end (delta: -999.4MB). Peak memory consumption was 709.7MB. Max. memory is 8.0GB. [2024-05-07 15:38:27,565 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 15:38:27,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.24ms. Allocated memory is still 304.1MB. Free memory was 234.3MB in the beginning and 222.3MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-07 15:38:27,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.06ms. Allocated memory is still 304.1MB. Free memory was 222.3MB in the beginning and 220.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 15:38:27,566 INFO L158 Benchmark]: Boogie Preprocessor took 22.75ms. Allocated memory is still 304.1MB. Free memory was 220.6MB in the beginning and 219.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 15:38:27,566 INFO L158 Benchmark]: RCFGBuilder took 404.99ms. Allocated memory is still 304.1MB. Free memory was 218.9MB in the beginning and 196.7MB in the end (delta: 22.2MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-05-07 15:38:27,566 INFO L158 Benchmark]: TraceAbstraction took 835117.59ms. Allocated memory was 304.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 195.5MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 670.9MB. Max. memory is 8.0GB. [2024-05-07 15:38:27,567 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.24ms. Allocated memory is still 304.1MB. Free memory was 234.3MB in the beginning and 222.3MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.06ms. Allocated memory is still 304.1MB. Free memory was 222.3MB in the beginning and 220.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.75ms. Allocated memory is still 304.1MB. Free memory was 220.6MB in the beginning and 219.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 404.99ms. Allocated memory is still 304.1MB. Free memory was 218.9MB in the beginning and 196.7MB in the end (delta: 22.2MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 835117.59ms. Allocated memory was 304.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 195.5MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 670.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 280875, independent: 266147, independent conditional: 238439, independent unconditional: 27708, dependent: 14459, dependent conditional: 13994, dependent unconditional: 465, unknown: 269, unknown conditional: 269, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 271234, independent: 266147, independent conditional: 238439, independent unconditional: 27708, dependent: 4818, dependent conditional: 4353, dependent unconditional: 465, unknown: 269, unknown conditional: 269, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 271234, independent: 266147, independent conditional: 238439, independent unconditional: 27708, dependent: 4818, dependent conditional: 4353, dependent unconditional: 465, unknown: 269, unknown conditional: 269, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 271234, independent: 266147, independent conditional: 238439, independent unconditional: 27708, dependent: 4818, dependent conditional: 4353, dependent unconditional: 465, unknown: 269, unknown conditional: 269, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 281301, independent: 266147, independent conditional: 95857, independent unconditional: 170290, dependent: 14407, dependent conditional: 8789, dependent unconditional: 5618, unknown: 747, unknown conditional: 349, unknown unconditional: 398] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 281301, independent: 266147, independent conditional: 72395, independent unconditional: 193752, dependent: 14407, dependent conditional: 4022, dependent unconditional: 10385, unknown: 747, unknown conditional: 99, unknown unconditional: 648] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 281301, independent: 266147, independent conditional: 72395, independent unconditional: 193752, dependent: 14407, dependent conditional: 4022, dependent unconditional: 10385, unknown: 747, unknown conditional: 99, unknown unconditional: 648] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1079, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 87, dependent conditional: 76, dependent unconditional: 11, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1079, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 95, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 76, dependent unconditional: 11, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 76, dependent unconditional: 11, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8548, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 977, dependent conditional: 448, dependent unconditional: 529, unknown: 7572, unknown conditional: 6559, unknown unconditional: 1013] , Protected Queries: 0 ], Cache Queries: [ total: 281301, independent: 265163, independent conditional: 72395, independent unconditional: 192768, dependent: 14320, dependent conditional: 3946, dependent unconditional: 10374, unknown: 1818, unknown conditional: 175, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 984, Positive conditional cache size: 0, Positive unconditional cache size: 984, Negative cache size: 87, Negative conditional cache size: 76, Negative unconditional cache size: 11, Unknown cache size: 8, Unknown conditional cache size: 7, Unknown unconditional cache size: 1, Eliminated conditions: 28479, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 281301, independent: 266147, independent conditional: 95857, independent unconditional: 170290, dependent: 14407, dependent conditional: 8789, dependent unconditional: 5618, unknown: 747, unknown conditional: 349, unknown unconditional: 398] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 281301, independent: 266147, independent conditional: 72395, independent unconditional: 193752, dependent: 14407, dependent conditional: 4022, dependent unconditional: 10385, unknown: 747, unknown conditional: 99, unknown unconditional: 648] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 281301, independent: 266147, independent conditional: 72395, independent unconditional: 193752, dependent: 14407, dependent conditional: 4022, dependent unconditional: 10385, unknown: 747, unknown conditional: 99, unknown unconditional: 648] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1079, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 87, dependent conditional: 76, dependent unconditional: 11, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1079, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 95, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 76, dependent unconditional: 11, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 76, dependent unconditional: 11, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8548, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 977, dependent conditional: 448, dependent unconditional: 529, unknown: 7572, unknown conditional: 6559, unknown unconditional: 1013] , Protected Queries: 0 ], Cache Queries: [ total: 281301, independent: 265163, independent conditional: 72395, independent unconditional: 192768, dependent: 14320, dependent conditional: 3946, dependent unconditional: 10374, unknown: 1818, unknown conditional: 175, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 984, Positive conditional cache size: 0, Positive unconditional cache size: 984, Negative cache size: 87, Negative conditional cache size: 76, Negative unconditional cache size: 11, Unknown cache size: 8, Unknown conditional cache size: 7, Unknown unconditional cache size: 1, Eliminated conditions: 28479 ], Independence queries for same thread: 9641 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-4-3-3-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-4-3-3-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-4-3-3-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-4-3-3-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-4-3-3-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 834.9s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 35, EmptinessCheckTime: 182.6s, 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: 454, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 649.8s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2381 ConstructedInterpolants, 36 QuantifiedInterpolants, 119733 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1462 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 2040/4125 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: 63.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 60, ConditionalCommutativityTraceChecks: 60, ConditionalCommutativityImperfectProofs: 24 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown