/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --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/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:45:35,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:45:35,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:45:35,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:45:35,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:45:35,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:45:35,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:45:35,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:45:35,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:45:35,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:45:35,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:45:35,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:45:35,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:45:35,808 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:45:35,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:45:35,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:45:35,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:45:35,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:45:35,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:45:35,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:45:35,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:45:35,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:45:35,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:45:35,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:45:35,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:45:35,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:45:35,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:45:35,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:45:35,810 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:45:35,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:45:35,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:45:35,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:45:35,812 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:45:35,813 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-05-30 16:45:36,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:45:36,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:45:36,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:45:36,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:45:36,082 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:45:36,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-30 16:45:37,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:45:37,222 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:45:37,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-30 16:45:37,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a14983a60/a3e4258c2982463794915fb52cc86469/FLAG3b9ade654 [2024-05-30 16:45:37,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a14983a60/a3e4258c2982463794915fb52cc86469 [2024-05-30 16:45:37,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:45:37,250 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:45:37,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:45:37,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:45:37,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:45:37,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd90a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37, skipping insertion in model container [2024-05-30 16:45:37,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,275 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:45:37,389 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/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-30 16:45:37,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:45:37,399 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:45:37,414 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/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-30 16:45:37,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:45:37,425 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:45:37,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37 WrapperNode [2024-05-30 16:45:37,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:45:37,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:45:37,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:45:37,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:45:37,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,462 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-05-30 16:45:37,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:45:37,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:45:37,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:45:37,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:45:37,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:45:37,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:45:37,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:45:37,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:45:37,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (1/1) ... [2024-05-30 16:45:37,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:45:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:37,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 16:45:37,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 16:45:37,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:45:37,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:45:37,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:45:37,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:45:37,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:45:37,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 16:45:37,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 16:45:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:45:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:45:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:45:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:45:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:45:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:45:37,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:45:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:45:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:45:37,560 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:45:37,627 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:45:37,629 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:45:37,820 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:45:37,882 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:45:37,883 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 16:45:37,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:45:37 BoogieIcfgContainer [2024-05-30 16:45:37,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:45:37,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:45:37,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:45:37,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:45:37,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:45:37" (1/3) ... [2024-05-30 16:45:37,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d3543d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:45:37, skipping insertion in model container [2024-05-30 16:45:37,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:45:37" (2/3) ... [2024-05-30 16:45:37,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d3543d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:45:37, skipping insertion in model container [2024-05-30 16:45:37,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:45:37" (3/3) ... [2024-05-30 16:45:37,889 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-05-30 16:45:37,895 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:45:37,903 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:45:37,903 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:45:37,903 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:45:37,950 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 16:45:37,988 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:45:37,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:45:37,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:37,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:45:37,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 16:45:38,041 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:45:38,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:45:38,054 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;@fe97052, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:45:38,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:45:38,062 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:38,182 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,182 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,182 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,241 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,241 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,241 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,290 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,290 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,290 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,303 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,303 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,303 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,321 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,321 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,321 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,345 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,345 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,345 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,352 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,382 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,382 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,382 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,478 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,478 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,478 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,545 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,546 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,546 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,619 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,619 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,653 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,654 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,654 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,683 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,683 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,683 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,714 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,724 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,724 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,724 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,748 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,748 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,749 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,766 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,767 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,767 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,787 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:38,788 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:38,788 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:38,797 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 229 states. [2024-05-30 16:45:38,798 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:45:38,800 INFO L78 Accepts]: Start accepts. Automaton has currently 249 states, but on-demand construction may add more states Word has length 69 [2024-05-30 16:45:38,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:38,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:38,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1970267391, now seen corresponding path program 1 times [2024-05-30 16:45:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248638448] [2024-05-30 16:45:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248638448] [2024-05-30 16:45:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248638448] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:45:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:45:39,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:45:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980267252] [2024-05-30 16:45:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:45:39,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:45:39,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:39,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:45:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:45:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:39,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:39,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:39,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:39,094 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:39,148 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,148 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,148 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,173 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,173 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,174 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,187 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,187 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,196 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,197 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,197 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,208 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,209 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,209 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,223 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,223 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,223 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,225 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,225 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,238 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,238 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,238 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,283 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,283 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,285 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,325 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,326 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,330 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,353 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,353 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,354 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,366 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,367 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,367 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,382 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,383 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,383 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,401 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,402 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,402 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,404 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,404 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,404 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,420 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,421 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,432 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,432 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,433 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,450 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:39,450 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:39,451 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:39,460 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 268 states. [2024-05-30 16:45:39,460 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:45:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:39,461 INFO L78 Accepts]: Start accepts. Automaton has currently 294 states, but on-demand construction may add more states Word has length 68 [2024-05-30 16:45:39,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:45:39,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:39,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:39,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1044785147, now seen corresponding path program 1 times [2024-05-30 16:45:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:39,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276797242] [2024-05-30 16:45:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:39,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:39,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:39,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276797242] [2024-05-30 16:45:39,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276797242] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:45:39,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:45:39,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:45:39,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769702535] [2024-05-30 16:45:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:45:39,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:45:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:39,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:45:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:45:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:39,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:39,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:39,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:39,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:39,962 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:40,023 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,023 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,023 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,055 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,056 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,057 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,076 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,077 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,077 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,089 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,089 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,089 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,106 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,107 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,107 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,127 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,128 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,128 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,130 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,130 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,130 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,146 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,146 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,159 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,159 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,159 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,171 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:40,171 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:40,171 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:40,191 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 233 states. [2024-05-30 16:45:40,191 INFO L212 cStratifiedReduction]: Copied states 8 times. [2024-05-30 16:45:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:40,192 INFO L78 Accepts]: Start accepts. Automaton has currently 262 states, but on-demand construction may add more states Word has length 71 [2024-05-30 16:45:40,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:40,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:45:40,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:40,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1349009576, now seen corresponding path program 1 times [2024-05-30 16:45:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854062207] [2024-05-30 16:45:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854062207] [2024-05-30 16:45:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854062207] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:45:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218268780] [2024-05-30 16:45:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:40,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:45:40,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:40,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:45:40,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 16:45:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:40,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2024-05-30 16:45:40,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:45:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:40,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:45:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218268780] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:45:41,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:45:41,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-05-30 16:45:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653720332] [2024-05-30 16:45:41,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:45:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-30 16:45:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-30 16:45:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-05-30 16:45:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:41,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:41,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.625) internal successors, (186), 16 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:41,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:41,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:41,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:41,232 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:41,400 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,400 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:41,400 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:45:41,420 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,421 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,439 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,440 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:41,440 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,450 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,450 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,450 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,464 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,465 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,465 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,481 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,482 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,482 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,501 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,501 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,501 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,501 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,502 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:41,502 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,571 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,572 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,572 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,588 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,589 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,606 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,606 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,606 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,615 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,616 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:41,616 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,619 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,620 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,622 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:41,622 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,622 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:41,638 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 275 states. [2024-05-30 16:45:41,638 INFO L212 cStratifiedReduction]: Copied states 20 times. [2024-05-30 16:45:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:41,639 INFO L78 Accepts]: Start accepts. Automaton has currently 310 states, but on-demand construction may add more states Word has length 73 [2024-05-30 16:45:41,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:41,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 16:45:41,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 16:45:41,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:41,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -553540837, now seen corresponding path program 1 times [2024-05-30 16:45:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:41,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306448406] [2024-05-30 16:45:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:41,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306448406] [2024-05-30 16:45:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306448406] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:45:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327075038] [2024-05-30 16:45:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:45:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:42,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:45:42,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 16:45:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:42,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-30 16:45:42,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:45:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:42,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:45:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327075038] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:45:43,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:45:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-05-30 16:45:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428419480] [2024-05-30 16:45:43,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:45:43,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 16:45:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 16:45:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-05-30 16:45:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:43,267 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.263157894736842) internal successors, (176), 19 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:43,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:43,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:43,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:43,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:43,267 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:43,587 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:43,587 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:43,587 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:43,600 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:43,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:43,600 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:45,630 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 [] [2024-05-30 16:45:46,541 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,541 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,541 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,575 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:46,576 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,584 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,584 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,584 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,599 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,599 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,599 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,614 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,615 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,615 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,668 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,668 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,668 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,668 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,668 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:46,668 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,706 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,707 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,707 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,724 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,724 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,724 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,747 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,747 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,748 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,758 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,759 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:46,759 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,762 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,763 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,763 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,765 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:46,766 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,766 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:46,813 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 292 states. [2024-05-30 16:45:46,813 INFO L212 cStratifiedReduction]: Copied states 24 times. [2024-05-30 16:45:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:46,814 INFO L78 Accepts]: Start accepts. Automaton has currently 329 states, but on-demand construction may add more states Word has length 76 [2024-05-30 16:45:46,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:46,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 16:45:47,019 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-05-30 16:45:47,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:47,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash -799123544, now seen corresponding path program 2 times [2024-05-30 16:45:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174036647] [2024-05-30 16:45:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174036647] [2024-05-30 16:45:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174036647] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:45:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137140096] [2024-05-30 16:45:47,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:45:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:45:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:47,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:45:47,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 16:45:47,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:45:47,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:45:47,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2024-05-30 16:45:47,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:45:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:48,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:45:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137140096] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:45:50,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:45:50,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 26 [2024-05-30 16:45:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701878013] [2024-05-30 16:45:50,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:45:50,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-30 16:45:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-30 16:45:50,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-05-30 16:45:50,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:50,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:50,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 26 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:50,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:50,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:50,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:50,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:50,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:50,273 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:51,124 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:51,125 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,138 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,138 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,138 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,153 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,153 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:51,153 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,160 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,160 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,160 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,172 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,172 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,172 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,189 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,189 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,189 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,206 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,206 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,206 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,226 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,226 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,226 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,226 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:51,226 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,243 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,243 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,243 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,304 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,304 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,305 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,360 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,360 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,360 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,412 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,413 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:51,413 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,419 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,419 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,419 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:51,462 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 332 states. [2024-05-30 16:45:51,462 INFO L212 cStratifiedReduction]: Copied states 26 times. [2024-05-30 16:45:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:45:51,463 INFO L78 Accepts]: Start accepts. Automaton has currently 372 states, but on-demand construction may add more states Word has length 84 [2024-05-30 16:45:51,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:51,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 16:45:51,671 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-05-30 16:45:51,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:51,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -11880905, now seen corresponding path program 1 times [2024-05-30 16:45:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468587517] [2024-05-30 16:45:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-30 16:45:51,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468587517] [2024-05-30 16:45:51,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468587517] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:45:51,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:45:51,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 16:45:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509779020] [2024-05-30 16:45:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:45:51,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 16:45:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 16:45:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-30 16:45:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:51,931 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:51,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:51,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:51,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:51,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:51,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:51,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:45:51,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:51,932 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:51,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:51,997 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:51,997 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,008 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,009 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,009 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,023 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,023 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:52,023 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,030 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,030 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,041 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,041 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,041 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,054 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,054 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,054 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,067 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,068 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,068 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,082 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,082 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,082 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,083 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,083 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:52,083 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,099 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,100 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,100 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,117 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,117 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,117 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,131 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,131 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,132 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,148 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,148 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:52,148 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,155 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,155 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,155 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,166 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,167 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,167 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,179 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,179 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,196 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,196 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,196 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,210 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:52,210 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,210 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~L~0, ~M~0, ~N~0, ~p~0, ~q~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:45:52,246 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 353 states. [2024-05-30 16:45:52,246 INFO L212 cStratifiedReduction]: Copied states 26 times. [2024-05-30 16:45:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:45:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:45:52,247 INFO L78 Accepts]: Start accepts. Automaton has currently 387 states, but on-demand construction may add more states Word has length 81 [2024-05-30 16:45:52,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:52,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 16:45:52,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:52,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1986886914, now seen corresponding path program 3 times [2024-05-30 16:45:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:52,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037145001] [2024-05-30 16:45:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:52,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037145001] [2024-05-30 16:45:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037145001] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:45:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722815527] [2024-05-30 16:45:52,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:45:52,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:45:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:52,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:45:52,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 16:45:52,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-30 16:45:52,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:45:52,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-30 16:45:52,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:45:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:53,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:45:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722815527] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:45:53,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:45:53,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2024-05-30 16:45:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206202794] [2024-05-30 16:45:53,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:45:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-30 16:45:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-30 16:45:53,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2024-05-30 16:45:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:53,838 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:53,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:45:53,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:45:53,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:53,839 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:45:55,210 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,210 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:55,210 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,221 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,221 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,221 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,236 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,236 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:55,237 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,242 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,242 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,242 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,255 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,255 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,269 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,269 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,269 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,356 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,356 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,356 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,391 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,392 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,392 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,392 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,392 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:55,392 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,417 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,417 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,417 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,431 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,431 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,432 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,467 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,468 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,468 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:45:55,484 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,489 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,490 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,490 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,502 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,502 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,502 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,517 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,517 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,517 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,532 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,532 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,532 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,553 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:45:55,554 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,554 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:45:55,596 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 406 states. [2024-05-30 16:45:55,596 INFO L212 cStratifiedReduction]: Copied states 30 times. [2024-05-30 16:45:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:45:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:45:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:45:55,608 INFO L78 Accepts]: Start accepts. Automaton has currently 460 states, but on-demand construction may add more states Word has length 86 [2024-05-30 16:45:55,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:45:55,628 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-05-30 16:45:55,809 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,SelfDestructingSolverStorable6 [2024-05-30 16:45:55,810 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:45:55,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:45:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -480494194, now seen corresponding path program 4 times [2024-05-30 16:45:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:45:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021720092] [2024-05-30 16:45:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:45:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:45:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:45:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:56,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:45:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021720092] [2024-05-30 16:45:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021720092] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:45:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675310664] [2024-05-30 16:45:56,718 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:45:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:45:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:45:56,719 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-05-30 16:45:56,748 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-05-30 16:45:56,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:45:56,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:45:56,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-30 16:45:56,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:45:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:57,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:45:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:45:58,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675310664] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:45:58,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:45:58,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 36 [2024-05-30 16:45:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055513387] [2024-05-30 16:45:58,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:45:58,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-30 16:45:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:45:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-30 16:45:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2024-05-30 16:45:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:58,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:45:58,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.25) internal successors, (153), 36 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:45:58,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:45:58,258 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:46:02,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:46:02,744 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,744 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:02,744 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,760 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,760 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,760 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,792 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,792 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,792 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,800 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,800 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:02,800 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,802 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,802 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,802 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,809 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,810 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,810 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,818 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:02,828 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,829 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,829 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,829 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,829 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:02,829 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,838 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,838 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,838 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,846 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,847 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,847 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,853 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,854 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,854 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,861 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,862 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,862 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,871 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,871 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,871 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,871 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,871 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,871 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,887 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:02,887 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:02,887 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:03,988 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 449 states. [2024-05-30 16:46:03,988 INFO L212 cStratifiedReduction]: Copied states 69 times. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:46:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:46:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:46:03,989 INFO L78 Accepts]: Start accepts. Automaton has currently 472 states, but on-demand construction may add more states Word has length 97 [2024-05-30 16:46:03,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:46:03,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-30 16:46:04,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:46:04,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:46:04,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:46:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 358433118, now seen corresponding path program 2 times [2024-05-30 16:46:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:46:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126784122] [2024-05-30 16:46:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:46:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:46:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:46:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-30 16:46:04,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:46:04,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126784122] [2024-05-30 16:46:04,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126784122] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:46:04,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:46:04,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:46:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42157489] [2024-05-30 16:46:04,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:46:04,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:46:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:46:04,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:46:04,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:46:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:04,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:46:04,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:46:04,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:46:04,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:46:04,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:04,483 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:46:04,584 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,585 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,585 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,591 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,591 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,610 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,610 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,610 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,622 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,622 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,622 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,624 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,624 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,624 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,632 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,632 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,632 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,640 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,640 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,640 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,649 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,649 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,649 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,649 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,649 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,650 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,659 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,659 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,659 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,667 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,667 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,674 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,674 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,674 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,682 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,682 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,682 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,691 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,691 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,691 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,691 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,692 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,692 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,706 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,706 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,706 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:04,782 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,783 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,783 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,793 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,793 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,793 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,812 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,812 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,818 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,833 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,833 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,834 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,854 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,854 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,854 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,872 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,872 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,872 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,890 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,890 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,890 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,890 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,890 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,890 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,917 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,917 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,917 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,933 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,933 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,933 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,975 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,975 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,975 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,992 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,992 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:04,992 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,998 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:04,998 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:04,998 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,012 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:05,013 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,013 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,028 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:05,028 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,028 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,046 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:05,046 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,046 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:46:05,051 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 685 states. [2024-05-30 16:46:05,051 INFO L212 cStratifiedReduction]: Copied states 102 times. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:46:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:46:05,052 INFO L78 Accepts]: Start accepts. Automaton has currently 785 states, but on-demand construction may add more states Word has length 100 [2024-05-30 16:46:05,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:46:05,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-30 16:46:05,053 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:46:05,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:46:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1065334045, now seen corresponding path program 3 times [2024-05-30 16:46:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:46:05,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040862545] [2024-05-30 16:46:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:46:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:46:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:46:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:46:07,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:46:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040862545] [2024-05-30 16:46:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040862545] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:46:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868320518] [2024-05-30 16:46:07,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:46:07,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:46:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:46:07,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:46:07,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 16:46:07,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-30 16:46:07,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:46:07,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-30 16:46:07,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:46:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:46:12,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:46:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 1 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:46:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868320518] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:46:14,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:46:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 22] total 70 [2024-05-30 16:46:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336736662] [2024-05-30 16:46:14,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:46:14,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-05-30 16:46:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:46:14,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-05-30 16:46:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=919, Invalid=3911, Unknown=0, NotChecked=0, Total=4830 [2024-05-30 16:46:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:14,079 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:46:14,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.057142857142857) internal successors, (214), 70 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:46:14,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:14,080 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:46:27,327 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,328 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:27,328 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,338 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,338 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,338 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,359 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,360 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:27,360 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,365 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,365 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,365 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,386 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,386 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,386 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,407 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,408 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,408 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,943 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:27,944 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:27,944 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,693 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:28,693 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,693 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,693 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:28,693 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:28,693 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,726 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:28,726 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,726 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,745 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:28,746 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:28,746 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,029 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,052 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:46:30,052 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,057 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,057 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,057 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,076 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,076 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,076 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,097 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,097 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,142 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,142 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,142 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,181 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:46:30,181 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:30,181 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:46:33,166 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 542 states. [2024-05-30 16:46:33,166 INFO L212 cStratifiedReduction]: Copied states 42 times. [2024-05-30 16:46:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:46:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:46:33,167 INFO L78 Accepts]: Start accepts. Automaton has currently 687 states, but on-demand construction may add more states Word has length 98 [2024-05-30 16:46:33,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:46:33,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 16:46:33,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 16:46:33,368 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:46:33,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:46:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1542284599, now seen corresponding path program 5 times [2024-05-30 16:46:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:46:33,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800330506] [2024-05-30 16:46:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:46:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:46:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:46:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:46:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:46:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800330506] [2024-05-30 16:46:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800330506] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:46:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833532686] [2024-05-30 16:46:34,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:46:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:46:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:46:34,551 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:46:34,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 16:46:34,922 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-05-30 16:46:34,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:46:34,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 39 conjunts are in the unsatisfiable core [2024-05-30 16:46:34,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:46:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:46:37,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:46:54,473 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~q~0 4294967295))) (let ((.cse1 (+ (mod (+ .cse3 4294967295) 4294967296) c_~p~0))) (let ((.cse0 (* (div .cse1 4294967296) 4294967296))) (and (<= .cse0 (+ 1 c_~p~0)) (<= (+ .cse0 4294967295) .cse1) (forall ((~M~0 Int)) (let ((.cse4 (* 6 ~M~0))) (<= (let ((.cse2 (mod (+ .cse4 c_~q~0) 4294967296))) (+ (* 4294967296 (div (+ (* 3 ~M~0) c_~p~0) 4294967296)) (* 4294967296 (div (+ (- 1) (* 2 ~M~0) (* (- 1) .cse2)) 4294967296)) (* (div (+ ~M~0 (mod (+ .cse3 4294967295 (* 4294967292 ~M~0)) 4294967296)) 4294967296) 4294967296) .cse2 4294967296)) (+ .cse4 c_~p~0)))))))) is different from false [2024-05-30 16:46:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-05-30 16:46:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833532686] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:46:55,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:46:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 24] total 69 [2024-05-30 16:46:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413731016] [2024-05-30 16:46:55,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:46:55,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-05-30 16:46:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:46:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-05-30 16:46:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=4224, Unknown=3, NotChecked=132, Total=4692 [2024-05-30 16:46:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:55,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:46:55,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.1594202898550723) internal successors, (218), 69 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:46:55,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:46:55,908 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:47:24,935 WARN L293 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:47:27,439 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 [] [2024-05-30 16:47:29,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:47:31,630 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 [] [2024-05-30 16:47:34,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q~0 4294967295))) (let ((.cse0 (* 4294967296 (div c_~N~0 4294967296))) (.cse3 (+ (mod (+ .cse5 4294967295) 4294967296) c_~p~0))) (let ((.cse2 (* (div .cse3 4294967296) 4294967296)) (.cse1 (<= (+ .cse0 1) c_~N~0))) (and (or (and (<= c_~N~0 .cse0) (= c_thread1Thread1of1ForFork0_~cond~0 0)) (and (= c_thread1Thread1of1ForFork0_~cond~0 1) .cse1)) (<= .cse2 (+ 1 c_~p~0)) (<= (+ .cse2 4294967295) .cse3) (= c_~q~0 0) .cse1 (forall ((~M~0 Int)) (let ((.cse6 (* 6 ~M~0))) (<= (let ((.cse4 (mod (+ .cse6 c_~q~0) 4294967296))) (+ (* 4294967296 (div (+ (* 3 ~M~0) c_~p~0) 4294967296)) (* 4294967296 (div (+ (- 1) (* 2 ~M~0) (* (- 1) .cse4)) 4294967296)) (* (div (+ ~M~0 (mod (+ .cse5 4294967295 (* 4294967292 ~M~0)) 4294967296)) 4294967296) 4294967296) .cse4 4294967296)) (+ .cse6 c_~p~0)))) (= 0 c_~p~0) (or (= (mod c_~p~0 4294967296) (mod (+ c_~q~0 (* 6 c_~M~0)) 4294967296)) (< 0 (mod c_thread1Thread1of1ForFork0_~cond~0 256))))))) is different from false [2024-05-30 16:47:51,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (+ c_~M~0 c_~p~0)) (.cse5 (mod (+ c_~q~0 (* 6 c_~M~0)) 4294967296))) (let ((.cse8 (mod c_~N~0 4294967296)) (.cse9 (* (- 1) .cse5)) (.cse17 (* c_~q~0 4294967295)) (.cse14 (* 4294967296 (div .cse15 4294967296))) (.cse6 (* c_~N~0 4294967295)) (.cse0 (* 2 c_~M~0))) (let ((.cse2 (+ .cse0 c_~p~0)) (.cse7 (or (= (+ .cse5 .cse14) .cse15) (not (= (mod (+ .cse6 1) 4294967296) 0)))) (.cse12 (= c_thread1Thread1of1ForFork0_~cond~0 1)) (.cse11 (= c_thread1Thread1of1ForFork0_~cond~0 0)) (.cse3 (* 4294967296 (div (+ (mod (+ .cse17 4294967295 (* 4294967292 c_~M~0)) 4294967296) c_~M~0) 4294967296))) (.cse4 (* (div (+ (- 1) .cse0 .cse9) 4294967296) 4294967296)) (.cse1 (mod (+ .cse17 4294967295 (* 4294967293 c_~M~0)) 4294967296)) (.cse13 (<= .cse8 0)) (.cse16 (= (* 3 c_~M~0) c_~p~0))) (and (or (and (<= (* (div (+ .cse0 .cse1 c_~p~0) 4294967296) 4294967296) .cse2) (<= (+ .cse3 .cse4 .cse5 (* (div .cse2 4294967296) 4294967296) 4294967296) (+ (* 5 c_~M~0) c_~p~0))) (not (= (mod (+ 5 .cse6) 4294967296) 0))) (or (and .cse7 (or (= (+ (* (div c_~p~0 4294967296) 4294967296) .cse5) c_~p~0) (< 0 .cse8))) (= (mod c_thread1Thread1of1ForFork0_~cond~0 256) 0)) (or (not (= (mod (+ 2 .cse6) 4294967296) 0)) (< (+ (* (div (+ (- 1) .cse0 c_~p~0 .cse9) 4294967296) 4294967296) 4294967295 .cse5) .cse2)) (let ((.cse10 (* 4294967296 (div c_~N~0 4294967296)))) (or (and (<= c_~N~0 .cse10) .cse11) (and .cse12 (<= (+ .cse10 1) c_~N~0)))) .cse7 (or (and .cse12 (<= 1 .cse8)) (and .cse13 .cse11)) (= c_~q~0 0) (or (and (<= (+ .cse3 .cse4 .cse5 .cse14 4294967296) (+ (* 4 c_~M~0) c_~p~0)) (<= (* (div (+ .cse1 c_~M~0 c_~p~0) 4294967296) 4294967296) .cse15)) (not (= (mod (+ 4 .cse6) 4294967296) 0))) (or (and (<= 1 (mod (+ c_~N~0 3) 4294967296)) (<= 1 (mod (+ c_~N~0 1) 4294967296)) (<= 1 (mod (+ c_~N~0 2) 4294967296)) .cse16) (and .cse13 (or (= c_~M~0 c_~p~0) (= .cse0 c_~p~0) (= 0 c_~p~0)))) .cse16)))) is different from false [2024-05-30 16:48:46,013 WARN L293 SmtUtils]: Spent 26.46s on a formula simplification. DAG size of input: 123 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:49:59,923 WARN L293 SmtUtils]: Spent 31.43s on a formula simplification. DAG size of input: 118 DAG size of output: 117 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:50:57,155 WARN L293 SmtUtils]: Spent 24.63s on a formula simplification. DAG size of input: 98 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:51:10,679 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,680 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:51:10,680 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,689 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,689 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,689 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,709 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,710 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:51:10,710 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,715 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,715 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,715 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,735 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,735 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,735 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,756 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,756 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,756 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,822 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,822 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,822 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,844 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,844 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,844 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,844 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,844 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:51:10,844 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,877 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,877 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,877 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,900 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,900 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,900 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,963 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,964 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,964 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:10,990 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:10,991 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:51:10,991 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,000 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:11,000 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,001 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,020 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:11,020 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,020 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,041 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:11,041 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,041 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,065 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:11,065 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,065 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,084 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:51:11,084 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:11,084 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:51:13,356 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 [] [2024-05-30 16:51:15,422 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 [] [2024-05-30 16:51:17,431 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 [] [2024-05-30 16:51:19,485 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 [] [2024-05-30 16:51:21,508 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 [] [2024-05-30 16:51:23,529 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 [] [2024-05-30 16:51:25,563 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 [] [2024-05-30 16:51:27,610 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 [] [2024-05-30 16:51:29,626 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 [] [2024-05-30 16:51:31,639 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 [] [2024-05-30 16:51:33,644 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 [] [2024-05-30 16:51:34,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:51:35,611 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 567 states. [2024-05-30 16:51:35,611 INFO L212 cStratifiedReduction]: Copied states 42 times. [2024-05-30 16:51:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:51:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:51:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:51:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:51:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:51:35,612 INFO L78 Accepts]: Start accepts. Automaton has currently 712 states, but on-demand construction may add more states Word has length 101 [2024-05-30 16:51:35,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:51:35,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-30 16:51:35,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:51:35,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:51:35,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:51:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1026947402, now seen corresponding path program 6 times [2024-05-30 16:51:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:51:35,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497319166] [2024-05-30 16:51:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:51:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:51:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:51:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:51:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:51:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497319166] [2024-05-30 16:51:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497319166] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:51:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013722681] [2024-05-30 16:51:36,875 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:51:36,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:51:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:51:36,876 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:51:36,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 16:51:37,061 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-30 16:51:37,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:51:37,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-30 16:51:37,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:51:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:51:41,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:51:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:51:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013722681] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:51:42,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:51:42,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 24] total 66 [2024-05-30 16:51:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426799589] [2024-05-30 16:51:42,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:51:42,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-05-30 16:51:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:51:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-05-30 16:51:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2024-05-30 16:51:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:51:42,166 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:51:42,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.878787878787879) internal successors, (190), 66 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:51:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:51:42,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:51:42,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:51:42,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:51:42,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:51:42,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:51:42,167 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:51:45,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:51:54,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:51:58,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:52:01,395 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 [] [2024-05-30 16:52:03,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:52:05,427 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,427 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:05,427 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,431 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,431 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,431 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,567 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,567 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,567 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,577 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,577 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:05,577 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,579 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,579 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,579 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,589 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,589 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,601 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,601 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,601 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:05,621 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,621 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,621 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,621 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,621 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:05,621 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,633 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,633 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,633 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,643 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,643 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,643 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,652 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,652 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,652 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,663 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,663 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,663 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,676 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,676 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,676 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,677 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,677 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,677 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,743 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:05,743 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:05,743 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:52:07,022 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,022 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:07,022 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,032 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,032 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,032 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,070 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,070 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:07,070 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,075 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,075 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,075 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,097 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,097 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,121 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,121 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,121 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,157 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,157 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,157 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,183 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:07,183 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,278 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,278 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,278 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,299 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,301 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,301 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,508 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,508 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,508 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,531 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,531 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:52:07,531 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,537 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,537 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,537 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,557 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,557 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,557 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,579 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,580 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,580 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,604 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:52:07,604 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:07,604 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0] [2024-05-30 16:52:12,620 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 924 states. [2024-05-30 16:52:12,621 INFO L212 cStratifiedReduction]: Copied states 144 times. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 16:52:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-30 16:52:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:52:12,622 INFO L78 Accepts]: Start accepts. Automaton has currently 1141 states, but on-demand construction may add more states Word has length 115 [2024-05-30 16:52:12,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:52:12,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 16:52:12,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:52:12,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:52:12,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:52:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 76493913, now seen corresponding path program 4 times [2024-05-30 16:52:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:52:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257452352] [2024-05-30 16:52:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:52:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:52:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:52:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 4 proven. 189 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:52:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:52:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257452352] [2024-05-30 16:52:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257452352] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:52:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276257829] [2024-05-30 16:52:14,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:52:14,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:52:14,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:52:14,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:52:14,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-30 16:52:14,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:52:14,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:52:14,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 42 conjunts are in the unsatisfiable core [2024-05-30 16:52:14,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:52:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:52:31,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:52:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:52:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276257829] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:52:34,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:52:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 24, 24] total 78 [2024-05-30 16:52:34,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058717079] [2024-05-30 16:52:34,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:52:34,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-05-30 16:52:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:52:34,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-05-30 16:52:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=5150, Unknown=0, NotChecked=0, Total=6006 [2024-05-30 16:52:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:52:34,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:52:34,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.3076923076923075) internal successors, (258), 78 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:52:34,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:52:34,102 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:42,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:54:44,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:56:05,597 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:05,597 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:56:05,597 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:56:05,601 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:05,601 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:56:05,601 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:56:37,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:56:38,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:58:25,405 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,406 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,421 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:58:25,422 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,424 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,424 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,424 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,437 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,437 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,438 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,453 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,453 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,453 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,490 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,490 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,490 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,490 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,490 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:58:25,490 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,505 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,506 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,506 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,517 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,517 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,517 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,551 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:25,551 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:25,551 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:27,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:58:30,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:58:46,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:58:46,576 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,586 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,586 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,586 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,751 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,752 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:58:46,752 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,757 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,757 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,757 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,783 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,783 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,783 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,811 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,811 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,811 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,842 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,842 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,842 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,869 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,869 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,869 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,869 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,869 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:58:46,870 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,921 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,922 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,922 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,949 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:46,949 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:46,949 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:58:51,190 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 [] [2024-05-30 16:59:16,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:16,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:16,875 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,121 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:17,121 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:59:17,121 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,140 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:17,140 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,140 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,169 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:17,169 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,169 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:17,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,200 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,242 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:17,242 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:17,242 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_~cond~0, ~L~0, ~N~0, thread2Thread1of1ForFork1_~cond~1] [2024-05-30 16:59:29,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:59:36,841 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1055 states. [2024-05-30 16:59:36,841 INFO L212 cStratifiedReduction]: Copied states 112 times. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-30 16:59:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:59:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-05-30 16:59:36,847 INFO L78 Accepts]: Start accepts. Automaton has currently 1462 states, but on-demand construction may add more states Word has length 130 [2024-05-30 16:59:36,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:59:36,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-05-30 16:59:37,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-30 16:59:37,048 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:59:37,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:59:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash -941957553, now seen corresponding path program 5 times [2024-05-30 16:59:37,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:59:37,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305481553] [2024-05-30 16:59:37,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:59:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:59:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:59:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 347 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:59:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:59:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305481553] [2024-05-30 16:59:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305481553] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:59:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282867021] [2024-05-30 16:59:39,694 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:59:39,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:59:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:59:39,696 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:59:39,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-30 16:59:41,578 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-05-30 16:59:41,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:59:41,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-30 16:59:41,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2024-05-30 16:59:55,573 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:59:55,576 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:59:55,576 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:59:55,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:59:55,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 16:59:55,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:59:55,908 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 131 with TraceHistMax 13,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-1 term,while SimplifyDDA2 was simplifying 11 xjuncts wrt. a ATOM-1 context. [2024-05-30 16:59:55,921 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 1, 1, 1] [2024-05-30 16:59:55,922 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-05-30 16:59:55,923 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:59:55,923 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:59:55,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:59:55 BasicIcfg [2024-05-30 16:59:55,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:59:55,926 INFO L158 Benchmark]: Toolchain (without parser) took 858676.50ms. Allocated memory was 333.4MB in the beginning and 877.7MB in the end (delta: 544.2MB). Free memory was 265.0MB in the beginning and 545.5MB in the end (delta: -280.6MB). Peak memory consumption was 264.3MB. Max. memory is 8.0GB. [2024-05-30 16:59:55,926 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 333.4MB. Free memory was 298.6MB in the beginning and 298.3MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:59:55,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.55ms. Allocated memory is still 333.4MB. Free memory was 264.7MB in the beginning and 253.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 16:59:55,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 333.4MB. Free memory was 253.1MB in the beginning and 251.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:59:55,926 INFO L158 Benchmark]: Boogie Preprocessor took 29.35ms. Allocated memory is still 333.4MB. Free memory was 251.2MB in the beginning and 250.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:59:55,927 INFO L158 Benchmark]: RCFGBuilder took 390.39ms. Allocated memory is still 333.4MB. Free memory was 250.0MB in the beginning and 299.1MB in the end (delta: -49.2MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2024-05-30 16:59:55,927 INFO L158 Benchmark]: TraceAbstraction took 858040.45ms. Allocated memory was 333.4MB in the beginning and 877.7MB in the end (delta: 544.2MB). Free memory was 298.1MB in the beginning and 545.5MB in the end (delta: -247.5MB). Peak memory consumption was 296.7MB. Max. memory is 8.0GB. [2024-05-30 16:59:55,928 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.12ms. Allocated memory is still 333.4MB. Free memory was 298.6MB in the beginning and 298.3MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.55ms. Allocated memory is still 333.4MB. Free memory was 264.7MB in the beginning and 253.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 333.4MB. Free memory was 253.1MB in the beginning and 251.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.35ms. Allocated memory is still 333.4MB. Free memory was 251.2MB in the beginning and 250.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 390.39ms. Allocated memory is still 333.4MB. Free memory was 250.0MB in the beginning and 299.1MB in the end (delta: -49.2MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. * TraceAbstraction took 858040.45ms. Allocated memory was 333.4MB in the beginning and 877.7MB in the end (delta: 544.2MB). Free memory was 298.1MB in the beginning and 545.5MB in the end (delta: -247.5MB). Peak memory consumption was 296.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6511, independent: 6072, independent conditional: 6072, independent unconditional: 0, dependent: 439, dependent conditional: 439, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6076, independent: 6072, independent conditional: 6072, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6076, independent: 6072, independent conditional: 6072, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6118, independent: 6072, independent conditional: 0, independent unconditional: 6072, dependent: 46, dependent conditional: 42, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6118, independent: 6072, independent conditional: 0, independent unconditional: 6072, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6118, independent: 6072, independent conditional: 0, independent unconditional: 6072, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6076, independent: 6072, independent conditional: 0, independent unconditional: 6072, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6076, independent: 6072, independent conditional: 0, independent unconditional: 6072, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6118, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 6076, unknown conditional: 0, unknown unconditional: 6076] , Statistics on independence cache: Total cache size (in pairs): 6076, Positive cache size: 6072, Positive conditional cache size: 0, Positive unconditional cache size: 6072, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 13, Independence queries for same thread: 435 - StatisticsResult: Reduction benchmarks 17.4ms Time before loop, 717.6ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 21, Reduction States: 229, Duplicate States: 14, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 24.0ms Time before loop, 341.8ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 21, Reduction States: 268, Duplicate States: 14, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 27.1ms Time before loop, 202.1ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 13, Reduction States: 233, Duplicate States: 8, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 120.2ms Time before loop, 285.4ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 275, Duplicate States: 20, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 235.5ms Time before loop, 3309.8ms Time in loop, 3.5s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 18, Reduction States: 292, Duplicate States: 24, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 749.7ms Time before loop, 439.4ms Time in loop, 1.2s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 17, Reduction States: 332, Duplicate States: 26, Protected Variables: 8 - StatisticsResult: Reduction benchmarks 26.2ms Time before loop, 287.9ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 20, Reduction States: 353, Duplicate States: 26, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 1109.0ms Time before loop, 647.8ms Time in loop, 1.8s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 20, Reduction States: 406, Duplicate States: 30, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 4090.3ms Time before loop, 1639.2ms Time in loop, 5.7s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 19, Reduction States: 449, Duplicate States: 69, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 13.2ms Time before loop, 555.4ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 36, Reduction States: 685, Duplicate States: 102, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 11465.5ms Time before loop, 7620.5ms Time in loop, 19.1s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 20, Reduction States: 542, Duplicate States: 42, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 254669.2ms Time before loop, 25033.5ms Time in loop, 279.7s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 20, Reduction States: 567, Duplicate States: 42, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 15051.4ms Time before loop, 15402.2ms Time in loop, 30.5s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 36, Reduction States: 924, Duplicate States: 144, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 120721.8ms Time before loop, 302017.0ms Time in loop, 422.7s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 32, Reduction States: 1055, Duplicate States: 112, Protected Variables: 4 - StatisticsResult: Visitor Statistics States: 165, Transitions: 231, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 165, Transitions: 232, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 127, Transitions: 166, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 159, Transitions: 225, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 166, Transitions: 234, Traversal time: 3.5s - StatisticsResult: Visitor Statistics States: 186, Transitions: 286, Traversal time: 1.2s - StatisticsResult: Visitor Statistics States: 205, Transitions: 314, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 238, Transitions: 375, Traversal time: 1.8s - StatisticsResult: Visitor Statistics States: 251, Transitions: 386, Traversal time: 5.7s - StatisticsResult: Visitor Statistics States: 420, Transitions: 707, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 334, Transitions: 555, Traversal time: 19.1s - StatisticsResult: Visitor Statistics States: 337, Transitions: 558, Traversal time: 279.7s - StatisticsResult: Visitor Statistics States: 585, Transitions: 1022, Traversal time: 30.5s - StatisticsResult: Visitor Statistics States: 676, Transitions: 1205, Traversal time: 422.7s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 68, RedundantProofs: 11, ProvenStates: 2055, Times there's more than one choice: 1763, Avg number of choices: 6.709975669099757 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 131 with TraceHistMax 13,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-11-1 term,while SimplifyDDA2 was simplifying 11 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 857.9s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 766.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: 407, 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.4s SatisfiabilityAnalysisTime, 68.1s InterpolantComputationTime, 1920 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2690 ConstructedInterpolants, 23 QuantifiedInterpolants, 31420 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1969 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 94/1678 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