/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 00:24:15,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 00:24:15,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 00:24:15,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 00:24:15,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 00:24:15,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 00:24:15,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 00:24:15,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 00:24:15,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 00:24:15,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 00:24:15,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 00:24:15,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 00:24:15,932 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 00:24:15,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 00:24:15,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 00:24:15,933 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 00:24:15,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 00:24:15,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 00:24:15,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 00:24:15,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 00:24:15,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 00:24:15,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 00:24:15,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 00:24:15,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 00:24:15,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 00:24:15,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 00:24:15,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 00:24:15,939 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 00:24:15,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 00:24:15,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 00:24:15,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 00:24:15,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 00:24:15,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 00:24:15,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 00:24:15,940 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 00:24:15,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 00:24:15,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 00:24:15,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 00:24:15,941 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 00:24:15,941 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 -> IA 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 -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-05 00:24:16,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 00:24:16,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 00:24:16,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 00:24:16,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 00:24:16,150 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 00:24:16,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-04-05 00:24:17,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 00:24:17,278 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 00:24:17,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-04-05 00:24:17,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7cfccade/6ce508c2728c4eb7afab2917730137dd/FLAGf416b5c9a [2024-04-05 00:24:17,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f7cfccade/6ce508c2728c4eb7afab2917730137dd [2024-04-05 00:24:17,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 00:24:17,305 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 00:24:17,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 00:24:17,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 00:24:17,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 00:24:17,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f5b6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17, skipping insertion in model container [2024-04-05 00:24:17,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 00:24:17,452 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/unroll-3.wvr.c[2500,2513] [2024-04-05 00:24:17,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 00:24:17,476 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 00:24:17,493 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/unroll-3.wvr.c[2500,2513] [2024-04-05 00:24:17,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 00:24:17,510 INFO L206 MainTranslator]: Completed translation [2024-04-05 00:24:17,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17 WrapperNode [2024-04-05 00:24:17,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 00:24:17,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 00:24:17,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 00:24:17,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 00:24:17,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,540 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-04-05 00:24:17,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 00:24:17,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 00:24:17,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 00:24:17,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 00:24:17,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 00:24:17,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 00:24:17,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 00:24:17,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 00:24:17,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (1/1) ... [2024-04-05 00:24:17,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 00:24:17,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:24:17,608 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-04-05 00:24:17,624 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-04-05 00:24:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 00:24:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 00:24:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 00:24:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 00:24:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 00:24:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 00:24:17,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 00:24:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 00:24:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 00:24:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 00:24:17,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 00:24:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 00:24:17,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 00:24:17,647 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 00:24:17,742 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 00:24:17,744 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 00:24:17,955 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 00:24:17,965 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 00:24:17,965 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-05 00:24:17,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:24:17 BoogieIcfgContainer [2024-04-05 00:24:17,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 00:24:17,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 00:24:17,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 00:24:17,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 00:24:17,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 12:24:17" (1/3) ... [2024-04-05 00:24:17,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451a2ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:24:17, skipping insertion in model container [2024-04-05 00:24:17,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:24:17" (2/3) ... [2024-04-05 00:24:17,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451a2ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:24:17, skipping insertion in model container [2024-04-05 00:24:17,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:24:17" (3/3) ... [2024-04-05 00:24:17,971 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-04-05 00:24:17,977 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 00:24:17,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 00:24:17,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 00:24:17,983 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 00:24:18,048 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 00:24:18,081 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 00:24:18,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 00:24:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:24:18,084 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-04-05 00:24:18,102 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-04-05 00:24:18,107 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 00:24:18,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:24:18,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 00:24:18,120 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;@516ce1ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 00:24:18,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 00:24:18,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:24:18,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:24:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash -283829721, now seen corresponding path program 1 times [2024-04-05 00:24:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:24:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489854145] [2024-04-05 00:24:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:24:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:24:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:24:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 00:24:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:24:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489854145] [2024-04-05 00:24:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489854145] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:24:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 00:24:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 00:24:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33661369] [2024-04-05 00:24:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:24:18,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 00:24:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:24:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 00:24:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 00:24:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:18,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:24:18,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 00:24:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 00:24:18,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:24:18,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:24:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1111227298, now seen corresponding path program 1 times [2024-04-05 00:24:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:24:18,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109949947] [2024-04-05 00:24:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:24:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:24:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:24:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:24:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:24:19,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109949947] [2024-04-05 00:24:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109949947] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:24:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 00:24:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 00:24:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363614322] [2024-04-05 00:24:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:24:19,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 00:24:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:24:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 00:24:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-04-05 00:24:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,164 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:24:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-04-05 00:24:19,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:24:19,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 00:24:19,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:24:19,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:24:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1883827620, now seen corresponding path program 1 times [2024-04-05 00:24:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:24:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716781409] [2024-04-05 00:24:19,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:24:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:24:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:24:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-04-05 00:24:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:24:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716781409] [2024-04-05 00:24:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716781409] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:24:19,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 00:24:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 00:24:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651419323] [2024-04-05 00:24:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:24:19,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 00:24:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:24:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 00:24:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-04-05 00:24:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:24:19,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 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-04-05 00:24:19,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:24:19,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:24:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:24:19,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 00:24:19,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:24:19,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:24:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash 945705873, now seen corresponding path program 1 times [2024-04-05 00:24:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:24:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756561762] [2024-04-05 00:24:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:24:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:24:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:24:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 00:24:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:24:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756561762] [2024-04-05 00:24:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756561762] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:24:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183133765] [2024-04-05 00:24:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:24:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:24:21,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:24:21,183 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-04-05 00:24:21,191 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-04-05 00:24:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:24:21,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 52 conjunts are in the unsatisfiable core [2024-04-05 00:24:21,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:24:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:24:23,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:24:24,342 INFO L349 Elim1Store]: treesize reduction 5, result has 91.8 percent of original size [2024-04-05 00:24:24,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 75 [2024-04-05 00:24:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:24:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183133765] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:24:25,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:24:25,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29, 25] total 66 [2024-04-05 00:24:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680383896] [2024-04-05 00:24:25,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:24:25,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-04-05 00:24:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:24:25,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-04-05 00:24:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3957, Unknown=0, NotChecked=0, Total=4290 [2024-04-05 00:24:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:25,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:24:25,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 7.181818181818182) internal successors, (474), 66 states have internal predecessors, (474), 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-04-05 00:24:25,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:25,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:24:25,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:24:25,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:24:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:24:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:24:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-04-05 00:24:34,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 00:24:34,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:24:34,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:24:34,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:24:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1422003260, now seen corresponding path program 2 times [2024-04-05 00:24:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:24:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703445855] [2024-04-05 00:24:34,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:24:34,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:24:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:24:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:24:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:24:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703445855] [2024-04-05 00:24:34,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703445855] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:24:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25744888] [2024-04-05 00:24:34,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 00:24:34,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:24:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:24:34,754 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-04-05 00:24:34,756 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-04-05 00:24:34,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 00:24:34,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 00:24:34,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 30 conjunts are in the unsatisfiable core [2024-04-05 00:24:34,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:24:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:24:35,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:24:46,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) is different from false [2024-04-05 00:25:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2024-04-05 00:25:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25744888] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:25:01,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:25:01,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2024-04-05 00:25:01,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753604622] [2024-04-05 00:25:01,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:25:01,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-04-05 00:25:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:25:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-04-05 00:25:01,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1277, Unknown=7, NotChecked=72, Total=1482 [2024-04-05 00:25:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:25:01,875 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:25:01,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.102564102564102) internal successors, (394), 39 states have internal predecessors, (394), 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-04-05 00:25:01,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:25:01,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:25:01,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:25:01,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-04-05 00:25:01,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:25:04,803 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1))) (let ((.cse2 (* 3 c_~n~0))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse2 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (forall ((v_z_1 Int)) (or (let ((.cse3 (* 8589934593 v_z_1))) (< (+ (* (div .cse3 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse3))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse4))) (< 4294967295 v_z_1))))) is different from false [2024-04-05 00:25:07,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 1) 4294967296) 1)))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))))) is different from false [2024-04-05 00:25:09,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:11,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:13,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:15,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:17,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:19,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:21,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:23,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:25,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:27,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:29,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:31,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:33,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:25:35,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:00,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:02,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:05,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:08,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:10,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:13,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:15,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:17,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:19,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:21,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:23,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:25,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:27,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:29,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:31,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:33,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:35,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:37,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:39,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:41,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:43,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:45,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:48,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:50,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:52,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:54,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:56,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:26:58,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:00,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:02,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:04,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:06,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:08,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:10,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:12,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:15,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:16,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:19,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:21,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:23,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:25,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:27,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:29,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:31,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:33,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:35,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:38,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:40,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:42,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:44,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:46,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:48,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:50,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:52,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:54,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:56,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:27:58,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:01,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:03,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:05,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:07,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:09,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:11,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:16,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:28:20,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:29:30,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* 3 c_~n~0))) (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse3 (* (div .cse5 4294967296) 4294967296)) (.cse4 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 1) 4294967296) 1)))) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1))) (<= (+ .cse3 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse4 .cse5)) (< (+ .cse3 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse5 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse6 (* 8589934593 v_z_1))) (< (+ (* (div .cse6 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse4 .cse6))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))))))) is different from false [2024-04-05 00:29:32,310 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (let ((.cse1 (* 3 c_~n~0))) (<= (+ (* (div .cse1 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse1)))) is different from false [2024-04-05 00:29:35,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (let ((.cse3 (* 8589934593 v_z_1))) (< (+ (* (div .cse3 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse3))) (< 4294967295 v_z_1))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-04-05 00:29:37,917 WARN L854 $PredicateComparison]: unable to prove that (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (or (let ((.cse1 (* 8589934593 v_z_1))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse1))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-04-05 00:29:40,095 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse3 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 1) 4294967296) 1)))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-04-05 00:29:54,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:29:56,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:29:58,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:00,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:02,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:04,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:06,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:08,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:10,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:30:58,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:00,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:02,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:05,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:07,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:09,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:11,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:14,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:16,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:18,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse3 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-04-05 00:31:20,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:22,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:24,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:26,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:28,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:30,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:32,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:34,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:36,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:39,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:41,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:43,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:45,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:47,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:49,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:51,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:54,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:56,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:31:58,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:01,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:04,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:06,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:08,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:10,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:12,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:14,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:51,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:53,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:55,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:57,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:32:59,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:01,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:03,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:05,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:07,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:09,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:11,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:13,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:15,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:17,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:19,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:26,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:28,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:30,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:32,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:34,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:36,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:38,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:40,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:42,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:44,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:46,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:48,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:50,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:52,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:54,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:56,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:33:58,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:01,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse3 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (< v_z_1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse0))) (< 4294967295 v_z_1))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (= 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse3))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-04-05 00:34:04,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:06,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:08,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:10,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:12,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:14,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (= 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (= 2 |c_thread1Thread1of1ForFork0_~i~0#1|))) is different from false [2024-04-05 00:34:16,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:18,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:20,536 WARN L854 $PredicateComparison]: unable to prove that (and (<= 4 (mod (* 3 c_~n~0) 4294967296)) (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (= 3 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-04-05 00:34:22,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:24,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:26,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:28,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:30,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:32,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:34,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:36,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:39,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:41,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:34:43,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:17,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:19,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:21,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:23,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:25,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:28,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:55,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:57,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:35:59,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:01,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:03,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:05,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:08,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:10,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:13,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:15,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:17,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:20,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:22,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:24,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:26,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:28,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:30,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:32,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:34,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ (* (div .cse2 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse2))) (forall ((v_z_1 Int)) (or (let ((.cse4 (* 8589934593 v_z_1))) (< (+ (* (div .cse4 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse4))) (< 4294967295 v_z_1) (< v_z_1 .cse1))))) is different from false [2024-04-05 00:36:36,371 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 c_~n~0))) (let ((.cse2 (* (div .cse4 4294967296) 4294967296)) (.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse4)) (< (+ .cse2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse4 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse5 (* 8589934593 v_z_1))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse5))) (< 4294967295 v_z_1) (< v_z_1 .cse1)))))) is different from false [2024-04-05 00:36:38,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:36:40,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 c_~n~0))) (let ((.cse3 (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296)) (.cse1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)) (.cse2 (* (div .cse4 4294967296) 4294967296))) (and (forall ((v_z_1 Int)) (or (let ((.cse0 (* 8589934593 v_z_1))) (< (+ (* (div .cse0 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse0))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse3 .cse4)) (< (+ .cse2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse4 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse5 (* 8589934593 v_z_1))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse3 .cse5))) (< 4294967295 v_z_1) (< v_z_1 .cse1))) (<= (+ .cse2 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ .cse4 (* (div (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 4294967296)))))) is different from false [2024-04-05 00:36:42,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 3 c_~n~0))) (let ((.cse0 (* (div .cse1 4294967296) 4294967296))) (and (< (+ .cse0 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ .cse1 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))) (forall ((v_z_1 Int)) (or (let ((.cse2 (* 8589934593 v_z_1))) (< (+ (* (div .cse2 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse2))) (< 4294967295 v_z_1) (< v_z_1 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)))) (<= (+ .cse0 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) (+ .cse1 (* (div (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 4294967296)))))) is different from false [2024-04-05 00:37:35,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:37:37,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:37:39,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-04-05 00:37:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:37:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 00:37:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 00:37:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-04-05 00:37:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-04-05 00:37:39,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-05 00:37:40,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:37:40,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:37:40,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:37:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2098206545, now seen corresponding path program 3 times [2024-04-05 00:37:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:37:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52259469] [2024-04-05 00:37:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:37:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:37:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:37:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 5 proven. 505 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 00:37:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:37:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52259469] [2024-04-05 00:37:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52259469] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:37:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37323054] [2024-04-05 00:37:41,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 00:37:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:37:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:37:41,437 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-04-05 00:37:41,439 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-04-05 00:37:42,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-04-05 00:37:42,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 00:37:42,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 196 conjunts are in the unsatisfiable core [2024-04-05 00:37:42,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:37:43,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-04-05 00:37:44,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-05 00:37:44,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-04-05 00:37:56,708 INFO L349 Elim1Store]: treesize reduction 16, result has 80.2 percent of original size [2024-04-05 00:37:56,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 109 [2024-04-05 00:37:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 22 proven. 464 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-04-05 00:37:57,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2024-04-05 00:38:49,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 00:38:49,566 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-04-05 00:38:49,597 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-04-05 00:38:49,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 00:38:49,600 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-04-05 00:38:49,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:38:49,758 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 170 known predicates. [2024-04-05 00:38:49,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 00:38:49,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 00:38:49,762 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-04-05 00:38:49,763 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 00:38:49,763 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 00:38:49,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:38:49 BasicIcfg [2024-04-05 00:38:49,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 00:38:49,765 INFO L158 Benchmark]: Toolchain (without parser) took 872459.96ms. Allocated memory was 321.9MB in the beginning and 590.3MB in the end (delta: 268.4MB). Free memory was 250.5MB in the beginning and 358.7MB in the end (delta: -108.2MB). Peak memory consumption was 160.5MB. Max. memory is 8.0GB. [2024-04-05 00:38:49,765 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 00:38:49,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.96ms. Allocated memory is still 321.9MB. Free memory was 250.3MB in the beginning and 288.9MB in the end (delta: -38.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2024-04-05 00:38:49,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.45ms. Allocated memory is still 321.9MB. Free memory was 288.9MB in the beginning and 287.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 00:38:49,766 INFO L158 Benchmark]: Boogie Preprocessor took 32.67ms. Allocated memory is still 321.9MB. Free memory was 286.9MB in the beginning and 285.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 00:38:49,766 INFO L158 Benchmark]: RCFGBuilder took 392.16ms. Allocated memory is still 321.9MB. Free memory was 285.3MB in the beginning and 267.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-04-05 00:38:49,766 INFO L158 Benchmark]: TraceAbstraction took 871797.47ms. Allocated memory was 321.9MB in the beginning and 590.3MB in the end (delta: 268.4MB). Free memory was 265.9MB in the beginning and 358.7MB in the end (delta: -92.8MB). Peak memory consumption was 176.2MB. Max. memory is 8.0GB. [2024-04-05 00:38:49,767 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 127.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.96ms. Allocated memory is still 321.9MB. Free memory was 250.3MB in the beginning and 288.9MB in the end (delta: -38.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.45ms. Allocated memory is still 321.9MB. Free memory was 288.9MB in the beginning and 287.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.67ms. Allocated memory is still 321.9MB. Free memory was 286.9MB in the beginning and 285.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 392.16ms. Allocated memory is still 321.9MB. Free memory was 285.3MB in the beginning and 267.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 871797.47ms. Allocated memory was 321.9MB in the beginning and 590.3MB in the end (delta: 268.4MB). Free memory was 265.9MB in the beginning and 358.7MB in the end (delta: -92.8MB). Peak memory consumption was 176.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8157, independent: 6488, independent conditional: 6486, independent unconditional: 2, dependent: 1669, dependent conditional: 1657, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 6486, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 6486, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 6486, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 816, independent unconditional: 5672, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 812, independent unconditional: 5676, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 812, independent unconditional: 5676, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1115, independent conditional: 31, independent unconditional: 1084, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6488, independent: 5373, independent conditional: 781, independent unconditional: 4592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 31, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 1115, Positive cache size: 1115, Positive conditional cache size: 31, Positive unconditional cache size: 1084, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 816, independent unconditional: 5672, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 812, independent unconditional: 5676, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6488, independent: 6488, independent conditional: 812, independent unconditional: 5676, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1115, independent conditional: 31, independent unconditional: 1084, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6488, independent: 5373, independent conditional: 781, independent unconditional: 4592, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 31, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 1115, Positive cache size: 1115, Positive conditional cache size: 31, Positive unconditional cache size: 1084, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4 ], Independence queries for same thread: 1669 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 170 known predicates. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 170 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 362 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 170 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 235 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 871.7s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 767.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1541 ConstructedInterpolants, 105 QuantifiedInterpolants, 17221 SizeOfPredicates, 47 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 49/342 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown