/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 02:16:57,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 02:16:57,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 02:16:57,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 02:16:57,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 02:16:57,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 02:16:57,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 02:16:57,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 02:16:57,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 02:16:57,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 02:16:57,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 02:16:57,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 02:16:57,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 02:16:57,661 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 02:16:57,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 02:16:57,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 02:16:57,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 02:16:57,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 02:16:57,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 02:16:57,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 02:16:57,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 02:16:57,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 02:16:57,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 02:16:57,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 02:16:57,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 02:16:57,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 02:16:57,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 02:16:57,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 02:16:57,663 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 02:16:57,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 02:16:57,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 02:16:57,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 02:16:57,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 02:16:57,664 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 02:16:57,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 02:16:57,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 02:16:57,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 02:16:57,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 02:16:57,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 02:16:57,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 02:16:57,665 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 02:16:57,665 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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 02:16:57,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 02:16:57,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 02:16:57,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 02:16:57,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 02:16:57,963 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 02:16:57,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2024-01-26 02:16:59,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 02:16:59,688 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 02:16:59,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2024-01-26 02:16:59,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6da976f33/d0b8ecd230494e02a1ad42013f92b7ed/FLAG9bcc0cc4a [2024-01-26 02:16:59,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6da976f33/d0b8ecd230494e02a1ad42013f92b7ed [2024-01-26 02:16:59,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 02:16:59,706 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 02:16:59,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 02:16:59,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 02:16:59,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 02:16:59,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c1eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59, skipping insertion in model container [2024-01-26 02:16:59,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,745 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 02:16:59,868 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-01-26 02:16:59,874 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 02:16:59,879 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 02:16:59,895 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-01-26 02:16:59,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 02:16:59,910 INFO L206 MainTranslator]: Completed translation [2024-01-26 02:16:59,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59 WrapperNode [2024-01-26 02:16:59,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 02:16:59,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 02:16:59,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 02:16:59,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 02:16:59,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,941 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 169 [2024-01-26 02:16:59,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 02:16:59,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 02:16:59,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 02:16:59,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 02:16:59,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 02:16:59,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 02:16:59,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 02:16:59,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 02:16:59,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (1/1) ... [2024-01-26 02:16:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 02:17:00,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:17:00,017 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-01-26 02:17:00,043 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-01-26 02:17:00,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 02:17:00,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 02:17:00,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 02:17:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 02:17:00,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 02:17:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 02:17:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 02:17:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 02:17:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 02:17:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 02:17:00,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 02:17:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 02:17:00,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 02:17:00,053 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 02:17:00,152 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 02:17:00,154 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 02:17:00,432 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 02:17:00,443 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 02:17:00,444 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 02:17:00,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:17:00 BoogieIcfgContainer [2024-01-26 02:17:00,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 02:17:00,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 02:17:00,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 02:17:00,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 02:17:00,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 02:16:59" (1/3) ... [2024-01-26 02:17:00,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4752b3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:17:00, skipping insertion in model container [2024-01-26 02:17:00,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:16:59" (2/3) ... [2024-01-26 02:17:00,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4752b3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:17:00, skipping insertion in model container [2024-01-26 02:17:00,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:17:00" (3/3) ... [2024-01-26 02:17:00,457 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2024-01-26 02:17:00,463 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 02:17:00,469 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 02:17:00,470 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 02:17:00,470 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 02:17:00,531 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 02:17:00,575 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:17:00,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 02:17:00,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:17:00,580 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-01-26 02:17:00,581 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-01-26 02:17:00,615 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 02:17:00,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 02:17:00,638 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=LoopsAndPotentialCycles, 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;@2b9ef7b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:17:00,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 02:17:01,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:17:01,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:17:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 852848871, now seen corresponding path program 1 times [2024-01-26 02:17:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:17:01,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217889437] [2024-01-26 02:17:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:01,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:17:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:17:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:17:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217889437] [2024-01-26 02:17:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217889437] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:17:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:17:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 02:17:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656258227] [2024-01-26 02:17:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:17:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 02:17:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:17:01,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 02:17:01,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 02:17:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:01,666 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:17:01,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 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-01-26 02:17:01,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:17:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:02,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 02:17:02,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:17:02,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:17:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash 889346555, now seen corresponding path program 1 times [2024-01-26 02:17:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:17:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455308768] [2024-01-26 02:17:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:17:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:17:02,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:17:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455308768] [2024-01-26 02:17:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455308768] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:17:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:17:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 02:17:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015675412] [2024-01-26 02:17:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:17:02,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 02:17:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:17:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 02:17:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-26 02:17:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:02,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:17:02,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-01-26 02:17:02,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:02,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:17:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:03,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 02:17:03,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:17:03,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:17:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash -562768857, now seen corresponding path program 1 times [2024-01-26 02:17:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:17:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276822222] [2024-01-26 02:17:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:17:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:17:03,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:17:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276822222] [2024-01-26 02:17:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276822222] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:17:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298497503] [2024-01-26 02:17:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:03,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:17:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:17:03,472 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-01-26 02:17:03,476 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-01-26 02:17:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:03,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 02:17:03,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:17:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:17:03,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:17:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:17:03,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298497503] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 02:17:03,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 02:17:03,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-01-26 02:17:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758958708] [2024-01-26 02:17:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:17:03,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 02:17:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:17:03,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 02:17:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-01-26 02:17:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:03,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:17:03,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-01-26 02:17:03,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:03,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:03,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:17:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:17:04,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-26 02:17:04,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-01-26 02:17:04,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:17:04,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:17:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 88311160, now seen corresponding path program 1 times [2024-01-26 02:17:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:17:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256533938] [2024-01-26 02:17:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:17:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-26 02:17:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:17:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256533938] [2024-01-26 02:17:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256533938] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:17:04,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852267164] [2024-01-26 02:17:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:04,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:17:04,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:17:04,810 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-01-26 02:17:04,814 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-01-26 02:17:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:04,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 37 conjunts are in the unsatisfiable core [2024-01-26 02:17:04,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:17:05,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-01-26 02:17:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:17:05,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:17:06,533 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-01-26 02:17:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-01-26 02:17:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:17:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852267164] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:17:07,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:17:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2024-01-26 02:17:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349181664] [2024-01-26 02:17:07,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:17:07,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-01-26 02:17:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:17:07,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-01-26 02:17:07,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2024-01-26 02:17:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:07,219 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:17:07,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.75609756097561) internal successors, (482), 41 states have internal predecessors, (482), 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-01-26 02:17:07,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:07,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:17:07,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:17:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:17:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-01-26 02:17:09,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 02:17:09,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:17:09,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:17:09,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:17:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1329896354, now seen corresponding path program 2 times [2024-01-26 02:17:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:17:09,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763580330] [2024-01-26 02:17:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:17:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:17:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 02:17:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:17:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763580330] [2024-01-26 02:17:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763580330] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:17:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916546654] [2024-01-26 02:17:13,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 02:17:13,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:17:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:17:13,839 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-01-26 02:17:13,854 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-01-26 02:17:14,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 02:17:14,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:17:14,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 17 conjunts are in the unsatisfiable core [2024-01-26 02:17:14,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:17:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 02:17:17,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:17:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 02:17:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916546654] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:17:22,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:17:22,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2024-01-26 02:17:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450191641] [2024-01-26 02:17:22,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:17:22,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-26 02:17:22,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:17:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-26 02:17:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=580, Unknown=2, NotChecked=0, Total=756 [2024-01-26 02:17:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:22,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:17:22,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.678571428571429) internal successors, (271), 28 states have internal predecessors, (271), 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-01-26 02:17:22,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:22,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:22,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:17:22,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-01-26 02:17:22,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:17:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:17:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:17:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:17:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-01-26 02:17:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-26 02:17:29,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-26 02:17:29,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:17:29,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:17:29,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:17:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash -834981958, now seen corresponding path program 3 times [2024-01-26 02:17:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:17:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355056933] [2024-01-26 02:17:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:17:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:17:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:19:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:19:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:19:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355056933] [2024-01-26 02:19:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355056933] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:19:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21671997] [2024-01-26 02:19:13,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 02:19:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:19:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:19:13,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 02:19:13,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-26 02:19:14,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-01-26 02:19:14,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:19:14,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 83 conjunts are in the unsatisfiable core [2024-01-26 02:19:14,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:19:15,474 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-01-26 02:19:15,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 02:19:16,047 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-01-26 02:19:17,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 02:19:17,937 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 63 treesize of output 107 [2024-01-26 02:19:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:19:18,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:19:21,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 02:19:21,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 156 [2024-01-26 02:19:22,502 INFO L349 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2024-01-26 02:19:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 614 treesize of output 937 [2024-01-26 02:19:23,213 INFO L349 Elim1Store]: treesize reduction 28, result has 93.4 percent of original size [2024-01-26 02:19:23,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 136 treesize of output 476 [2024-01-26 02:19:26,002 INFO L349 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2024-01-26 02:19:26,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 81 treesize of output 502 [2024-01-26 02:20:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-01-26 02:20:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21671997] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:20:53,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:20:53,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 40, 31] total 122 [2024-01-26 02:20:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059930920] [2024-01-26 02:20:53,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:20:53,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2024-01-26 02:20:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:20:53,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2024-01-26 02:20:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=14043, Unknown=61, NotChecked=0, Total=14762 [2024-01-26 02:20:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:20:53,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:20:53,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.524590163934426) internal successors, (674), 122 states have internal predecessors, (674), 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-01-26 02:20:53,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:20:53,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:20:53,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:20:53,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-01-26 02:20:53,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-01-26 02:20:53,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:21:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:21:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:21:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:21:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-01-26 02:21:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-26 02:21:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-01-26 02:21:05,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-26 02:21:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-26 02:21:05,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:21:05,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:21:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -521499232, now seen corresponding path program 4 times [2024-01-26 02:21:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:21:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325652448] [2024-01-26 02:21:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:21:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:21:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:21:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-01-26 02:21:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:21:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325652448] [2024-01-26 02:21:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325652448] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:21:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390584006] [2024-01-26 02:21:06,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 02:21:06,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:21:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:21:06,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 02:21:06,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 02:21:06,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 02:21:06,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:21:06,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 68 conjunts are in the unsatisfiable core [2024-01-26 02:21:06,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:21:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:21:07,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:22:05,233 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) is different from false [2024-01-26 02:22:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 182 refuted. 15 times theorem prover too weak. 85 trivial. 5 not checked. [2024-01-26 02:22:36,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390584006] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:22:36,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:22:36,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35, 25] total 58 [2024-01-26 02:22:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399699461] [2024-01-26 02:22:36,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:22:36,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-01-26 02:22:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:22:36,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-01-26 02:22:36,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2974, Unknown=37, NotChecked=110, Total=3306 [2024-01-26 02:22:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:22:36,439 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:22:36,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.344827586206897) internal successors, (426), 58 states have internal predecessors, (426), 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-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-01-26 02:22:36,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:24:21,210 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-01-26 02:24:23,225 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-01-26 02:24:25,275 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-01-26 02:24:27,330 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-01-26 02:24:29,381 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-01-26 02:24:31,401 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-01-26 02:24:33,422 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-01-26 02:24:35,570 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-01-26 02:24:37,578 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-01-26 02:24:39,591 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-01-26 02:24:41,601 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-01-26 02:24:43,609 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-01-26 02:24:45,659 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-01-26 02:24:47,667 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-01-26 02:24:49,687 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-01-26 02:24:51,698 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-01-26 02:24:53,705 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-01-26 02:24:55,723 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-01-26 02:24:57,773 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-01-26 02:24:59,784 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-01-26 02:25:01,789 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-01-26 02:25:03,797 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-01-26 02:25:05,803 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-01-26 02:25:07,809 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-01-26 02:25:10,171 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-01-26 02:25:12,185 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-01-26 02:25:14,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:25:16,281 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-01-26 02:25:18,293 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-01-26 02:25:20,345 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-01-26 02:25:22,364 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-01-26 02:25:24,385 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-01-26 02:25:26,412 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (let ((.cse4 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse5 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse5 4294967296) 4294967296)) .cse5)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse6 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse6 4294967296) 4294967296)) .cse6)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse7 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse7 4294967296) 4294967296)) .cse7)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse8 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse8 4294967296) 4294967296)) .cse8)))) (let ((.cse9 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse9 4294967296) 4294967296)) .cse9))) is different from false [2024-01-26 02:25:28,423 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-01-26 02:25:30,437 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-01-26 02:25:32,449 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-01-26 02:25:34,458 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-01-26 02:25:36,464 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-01-26 02:25:38,472 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-01-26 02:25:40,489 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-01-26 02:25:42,504 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-01-26 02:25:44,511 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-01-26 02:25:46,519 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-01-26 02:25:48,527 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-01-26 02:25:50,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:25:52,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:25:54,900 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-01-26 02:25:56,908 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-01-26 02:25:58,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-01-26 02:26:00,949 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-01-26 02:26:02,965 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-01-26 02:26:05,542 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-01-26 02:26:07,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-01-26 02:26:09,568 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-01-26 02:26:11,585 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-01-26 02:26:13,598 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-01-26 02:26:15,609 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-01-26 02:26:17,617 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-01-26 02:26:19,626 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-01-26 02:26:21,634 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-01-26 02:26:23,641 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-01-26 02:26:25,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (= 5 |c_thread1Thread1of1ForFork0_~i~0#1|) (<= .cse1 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse4 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)))) (let ((.cse5 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse5 4294967296) 4294967296)) (+ .cse5 (* .cse1 4294967296)))))) is different from false [2024-01-26 02:26:27,686 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse3 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse5 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse5 4294967296) 4294967296)) .cse5))) is different from false [2024-01-26 02:26:29,696 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2024-01-26 02:26:31,821 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse3 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2024-01-26 02:26:33,859 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2024-01-26 02:26:35,874 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-01-26 02:26:37,979 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-01-26 02:26:39,989 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-01-26 02:26:42,077 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse2 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2024-01-26 02:26:44,189 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (let ((.cse2 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2024-01-26 02:26:46,203 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* v_z_2 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse2 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2024-01-26 02:27:08,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-01-26 02:27:11,009 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-01-26 02:27:13,129 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-01-26 02:27:16,016 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-01-26 02:27:18,021 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-01-26 02:27:20,030 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-01-26 02:27:22,043 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-01-26 02:27:24,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-01-26 02:27:26,056 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-01-26 02:27:44,204 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-01-26 02:27:46,507 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-01-26 02:27:48,516 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-01-26 02:27:50,895 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-01-26 02:27:52,913 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-01-26 02:27:55,974 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-01-26 02:27:57,992 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-01-26 02:28:00,008 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-01-26 02:28:02,152 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-01-26 02:28:04,160 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-01-26 02:28:06,192 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-01-26 02:28:08,311 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-01-26 02:28:10,371 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-01-26 02:28:12,382 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-01-26 02:28:14,396 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-01-26 02:28:16,405 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-01-26 02:28:18,423 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-01-26 02:28:20,447 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-01-26 02:28:22,452 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-01-26 02:28:24,461 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-01-26 02:28:26,488 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-01-26 02:28:50,239 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-01-26 02:28:52,243 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-01-26 02:28:54,252 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-01-26 02:28:56,260 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-01-26 02:28:58,266 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-01-26 02:29:18,891 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-01-26 02:29:21,068 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-01-26 02:29:23,080 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-01-26 02:29:40,625 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-01-26 02:29:42,632 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-01-26 02:29:44,640 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-01-26 02:29:46,646 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-01-26 02:29:49,480 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-01-26 02:29:51,489 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-01-26 02:29:53,504 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-01-26 02:29:55,603 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-01-26 02:29:57,617 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-01-26 02:29:59,742 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-01-26 02:30:02,575 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-01-26 02:30:04,618 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-01-26 02:30:06,631 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-01-26 02:30:08,638 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-01-26 02:30:10,760 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-01-26 02:30:13,305 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-01-26 02:30:15,312 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-01-26 02:30:17,320 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-01-26 02:30:19,791 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-01-26 02:30:21,803 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-01-26 02:30:23,808 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-01-26 02:30:25,815 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-01-26 02:30:26,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:30:28,904 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-01-26 02:30:30,910 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-01-26 02:30:32,929 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-01-26 02:30:35,286 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-01-26 02:31:03,060 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-01-26 02:31:05,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] Received shutdown request... [2024-01-26 02:31:13,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 02:31:13,174 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-01-26 02:31:13,175 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-01-26 02:31:13,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-26 02:31:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:31:13,849 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 119 known predicates. [2024-01-26 02:31:13,851 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 02:31:13,859 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-01-26 02:31:13,860 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-01-26 02:31:13,861 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 02:31:13,861 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 02:31:13,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 02:31:13 BasicIcfg [2024-01-26 02:31:13,863 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 02:31:13,863 INFO L158 Benchmark]: Toolchain (without parser) took 854157.41ms. Allocated memory was 175.1MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 122.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-01-26 02:31:13,863 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 175.1MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 02:31:13,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.18ms. Allocated memory is still 175.1MB. Free memory was 122.1MB in the beginning and 109.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 02:31:13,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.55ms. Allocated memory is still 175.1MB. Free memory was 109.9MB in the beginning and 107.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 02:31:13,864 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 175.1MB. Free memory was 107.6MB in the beginning and 106.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 02:31:13,864 INFO L158 Benchmark]: RCFGBuilder took 470.73ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 106.0MB in the beginning and 176.3MB in the end (delta: -70.3MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2024-01-26 02:31:13,864 INFO L158 Benchmark]: TraceAbstraction took 853409.46ms. Allocated memory was 210.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 175.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-01-26 02:31:13,865 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.14ms. Allocated memory is still 175.1MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.18ms. Allocated memory is still 175.1MB. Free memory was 122.1MB in the beginning and 109.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.55ms. Allocated memory is still 175.1MB. Free memory was 109.9MB in the beginning and 107.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 175.1MB. Free memory was 107.6MB in the beginning and 106.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 470.73ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 106.0MB in the beginning and 176.3MB in the end (delta: -70.3MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * TraceAbstraction took 853409.46ms. Allocated memory was 210.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 175.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7633, independent: 7019, independent conditional: 7019, independent unconditional: 0, dependent: 614, dependent conditional: 614, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7019, independent: 7019, independent conditional: 7019, independent unconditional: 0, 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: 7019, independent: 7019, independent conditional: 7019, independent unconditional: 0, 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: 7019, independent: 7019, independent conditional: 0, independent unconditional: 7019, 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: 7019, independent: 7019, independent conditional: 0, independent unconditional: 7019, 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: 7019, independent: 7019, independent conditional: 0, independent unconditional: 7019, 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: 7019, independent: 7019, independent conditional: 0, independent unconditional: 7019, 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: 7019, independent: 7019, independent conditional: 0, independent unconditional: 7019, 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 7019, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7019, unknown conditional: 0, unknown unconditional: 7019] , Statistics on independence cache: Total cache size (in pairs): 7019, Positive cache size: 7019, Positive conditional cache size: 0, Positive unconditional cache size: 7019, 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: 0, Maximal queried relation: 0, Independence queries for same thread: 614 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 19, RedundantProofs: 5, ProvenStates: 688, Times there's more than one choice: 546, Avg number of choices: 3.9026162790697674 - StatisticsResult: Reduction benchmarks 3.2s Time before loop, 9.1s Time in loop, 12.3s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, thread1_#res#1.base, thread2_#res#1.base, thread2Thread1of1ForFork1_~_argptr#1.base, thread1_#t~mem1#1, thread2_#t~mem3#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~mem21#1, thread2_#t~mem5#1, thread2_#t~mem7#1, thread2_#t~mem9#1, ULTIMATE.start_main_#res#1, thread2Thread1of1ForFork1_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, old(~size~0), ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork0_#t~mem1#1, read~int_#ptr.base, ULTIMATE.start_#t~ret25#1, ~f~0.base, old(~f~0.base), ULTIMATE.start_create_fresh_int_array_#in~size#1, thread1_#res#1.offset, thread2_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~_argptr#1.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, old(~x1~0), ~x2~0, old(~x2~0), thread1_#t~post2#1, thread2_#t~post4#1, thread2_#t~post6#1, thread2_#t~post8#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~pre18#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret15#1.base, thread1Thread1of1ForFork0_#t~post2#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, #Ultimate.allocOnHeap_#res.base, ~n~0, old(~n~0), thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post12#1, thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2_#t~post10#1, thread2_#t~post12#1, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, old(#StackHeapBarrier), ULTIMATE.start_create_fresh_int_array_#t~post23#1, thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), thread1_~i~0#1, thread2_~i~1#1, write~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), thread2_#t~mem11#1, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork1_#res#1.base, ~f~0.offset, old(~f~0.offset), thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem9#1, thread1Thread1of1ForFork0_~i~0#1, read~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset], Protected Variables before encountering a loop: [] - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 119 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 291 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 853.3s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 539.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 231, 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, 1.7s SatisfiabilityAnalysisTime, 309.9s InterpolantComputationTime, 2263 NumberOfCodeBlocks, 2263 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3274 ConstructedInterpolants, 156 QuantifiedInterpolants, 67577 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1961 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 277/1495 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