/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:29:23,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:29:23,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:29:23,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:29:23,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:29:23,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:29:23,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:29:23,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:29:23,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:29:23,990 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:29:23,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:29:23,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:29:23,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:29:23,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:29:23,992 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:29:23,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:29:23,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:29:23,993 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:29:23,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:29:23,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:29:23,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:29:23,994 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:29:23,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:29:23,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:29:23,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:29:23,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:29:23,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:29:23,997 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:29:23,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:29:23,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:29:23,997 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:29:24,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:29:24,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:29:24,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:29:24,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:29:24,207 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:29:24,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2023-12-16 04:29:25,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:29:25,404 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:29:25,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2023-12-16 04:29:25,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f12bfc99/87fced84251d4de3acd223a243395a1e/FLAGfbcbaa8f9 [2023-12-16 04:29:25,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f12bfc99/87fced84251d4de3acd223a243395a1e [2023-12-16 04:29:25,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:29:25,787 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:29:25,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:29:25,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:29:25,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:29:25,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:25" (1/1) ... [2023-12-16 04:29:25,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a4e6bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:25, skipping insertion in model container [2023-12-16 04:29:25,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:25" (1/1) ... [2023-12-16 04:29:25,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:29:25,916 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i[916,929] [2023-12-16 04:29:25,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:29:25,964 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:29:25,971 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i[916,929] [2023-12-16 04:29:25,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:29:26,006 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:29:26,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26 WrapperNode [2023-12-16 04:29:26,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:29:26,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:29:26,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:29:26,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:29:26,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,070 INFO L138 Inliner]: procedures = 26, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2023-12-16 04:29:26,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:29:26,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:29:26,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:29:26,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:29:26,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,122 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2023-12-16 04:29:26,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:29:26,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:29:26,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:29:26,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:29:26,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (1/1) ... [2023-12-16 04:29:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:29:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:29:26,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:29:26,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:29:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:29:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:29:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:29:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:29:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:29:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:29:26,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:29:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:29:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:29:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:29:26,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:29:26,320 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:29:26,321 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:29:26,615 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:29:26,635 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:29:26,636 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:29:26,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:26 BoogieIcfgContainer [2023-12-16 04:29:26,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:29:26,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:29:26,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:29:26,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:29:26,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:29:25" (1/3) ... [2023-12-16 04:29:26,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4511d432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:26, skipping insertion in model container [2023-12-16 04:29:26,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:26" (2/3) ... [2023-12-16 04:29:26,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4511d432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:26, skipping insertion in model container [2023-12-16 04:29:26,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:26" (3/3) ... [2023-12-16 04:29:26,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-66.i [2023-12-16 04:29:26,653 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:29:26,653 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:29:26,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:29:26,716 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60bae54b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:29:26,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:29:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:29:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:29:26,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:26,730 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:26,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:26,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1993153253, now seen corresponding path program 1 times [2023-12-16 04:29:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216190153] [2023-12-16 04:29:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216190153] [2023-12-16 04:29:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216190153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612656581] [2023-12-16 04:29:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:27,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:27,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:27,201 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:27,312 INFO L93 Difference]: Finished difference Result 163 states and 259 transitions. [2023-12-16 04:29:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:27,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2023-12-16 04:29:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:27,320 INFO L225 Difference]: With dead ends: 163 [2023-12-16 04:29:27,320 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 04:29:27,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:27,326 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 12 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:27,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 315 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:29:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 04:29:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-12-16 04:29:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:29:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2023-12-16 04:29:27,355 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 104 [2023-12-16 04:29:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:27,356 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2023-12-16 04:29:27,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2023-12-16 04:29:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:29:27,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:27,359 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:27,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:29:27,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:27,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2050411555, now seen corresponding path program 1 times [2023-12-16 04:29:27,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085425677] [2023-12-16 04:29:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:27,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:27,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085425677] [2023-12-16 04:29:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085425677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:27,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:27,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910151349] [2023-12-16 04:29:27,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:27,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:27,571 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:27,617 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2023-12-16 04:29:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2023-12-16 04:29:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:27,619 INFO L225 Difference]: With dead ends: 161 [2023-12-16 04:29:27,619 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 04:29:27,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:27,620 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:27,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 316 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 04:29:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-12-16 04:29:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:29:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2023-12-16 04:29:27,628 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 104 [2023-12-16 04:29:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:27,628 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2023-12-16 04:29:27,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2023-12-16 04:29:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:29:27,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:27,635 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:29:27,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:27,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2050471137, now seen corresponding path program 1 times [2023-12-16 04:29:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792857113] [2023-12-16 04:29:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792857113] [2023-12-16 04:29:28,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792857113] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:28,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:28,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627540607] [2023-12-16 04:29:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:28,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:28,389 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:28,588 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2023-12-16 04:29:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:29:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2023-12-16 04:29:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:28,595 INFO L225 Difference]: With dead ends: 241 [2023-12-16 04:29:28,595 INFO L226 Difference]: Without dead ends: 161 [2023-12-16 04:29:28,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:28,600 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 74 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:28,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 254 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-16 04:29:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2023-12-16 04:29:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:29:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2023-12-16 04:29:28,624 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 104 [2023-12-16 04:29:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:28,624 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2023-12-16 04:29:28,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2023-12-16 04:29:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:29:28,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:28,630 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:28,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:29:28,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:28,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2064766436, now seen corresponding path program 1 times [2023-12-16 04:29:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:28,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100143326] [2023-12-16 04:29:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:30,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:30,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100143326] [2023-12-16 04:29:30,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100143326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:30,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:30,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:29:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236218022] [2023-12-16 04:29:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:30,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:29:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:29:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:29:30,539 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 12 states, 9 states have (on average 4.222222222222222) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:29:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:31,477 INFO L93 Difference]: Finished difference Result 500 states and 723 transitions. [2023-12-16 04:29:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:29:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 4.222222222222222) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 105 [2023-12-16 04:29:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:31,480 INFO L225 Difference]: With dead ends: 500 [2023-12-16 04:29:31,480 INFO L226 Difference]: Without dead ends: 348 [2023-12-16 04:29:31,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:29:31,481 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 298 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:31,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 632 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:29:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-16 04:29:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 169. [2023-12-16 04:29:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:29:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2023-12-16 04:29:31,499 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 105 [2023-12-16 04:29:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:31,500 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2023-12-16 04:29:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 4.222222222222222) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:29:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2023-12-16 04:29:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:29:31,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:31,501 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:29:31,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:31,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1972035422, now seen corresponding path program 1 times [2023-12-16 04:29:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851632014] [2023-12-16 04:29:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:32,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851632014] [2023-12-16 04:29:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851632014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863396569] [2023-12-16 04:29:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:32,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:32,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:32,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:32,023 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:32,428 INFO L93 Difference]: Finished difference Result 419 states and 598 transitions. [2023-12-16 04:29:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:29:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-12-16 04:29:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:32,431 INFO L225 Difference]: With dead ends: 419 [2023-12-16 04:29:32,431 INFO L226 Difference]: Without dead ends: 331 [2023-12-16 04:29:32,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:32,432 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 290 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:32,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 355 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-12-16 04:29:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 203. [2023-12-16 04:29:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 165 states have internal predecessors, (221), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:29:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 289 transitions. [2023-12-16 04:29:32,457 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 289 transitions. Word has length 105 [2023-12-16 04:29:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:32,457 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 289 transitions. [2023-12-16 04:29:32,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 289 transitions. [2023-12-16 04:29:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:29:32,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:32,459 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:32,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:29:32,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:32,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1043698082, now seen corresponding path program 1 times [2023-12-16 04:29:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:32,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432687754] [2023-12-16 04:29:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432687754] [2023-12-16 04:29:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432687754] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:29:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369137272] [2023-12-16 04:29:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:33,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:29:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:29:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:33,081 INFO L87 Difference]: Start difference. First operand 203 states and 289 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:33,597 INFO L93 Difference]: Finished difference Result 529 states and 746 transitions. [2023-12-16 04:29:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:29:33,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-12-16 04:29:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:33,600 INFO L225 Difference]: With dead ends: 529 [2023-12-16 04:29:33,600 INFO L226 Difference]: Without dead ends: 333 [2023-12-16 04:29:33,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:29:33,601 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 215 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:33,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 331 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:29:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-16 04:29:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 263. [2023-12-16 04:29:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 208 states have (on average 1.3125) internal successors, (273), 210 states have internal predecessors, (273), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 04:29:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 369 transitions. [2023-12-16 04:29:33,630 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 369 transitions. Word has length 105 [2023-12-16 04:29:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:33,630 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 369 transitions. [2023-12-16 04:29:33,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 369 transitions. [2023-12-16 04:29:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 04:29:33,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:33,632 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:33,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:29:33,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:33,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash -647041737, now seen corresponding path program 1 times [2023-12-16 04:29:33,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980039525] [2023-12-16 04:29:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:33,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980039525] [2023-12-16 04:29:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980039525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592693914] [2023-12-16 04:29:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:34,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:34,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:34,022 INFO L87 Difference]: Start difference. First operand 263 states and 369 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:34,181 INFO L93 Difference]: Finished difference Result 453 states and 635 transitions. [2023-12-16 04:29:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:29:34,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2023-12-16 04:29:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:34,184 INFO L225 Difference]: With dead ends: 453 [2023-12-16 04:29:34,184 INFO L226 Difference]: Without dead ends: 197 [2023-12-16 04:29:34,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:34,187 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:34,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 235 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:29:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-16 04:29:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2023-12-16 04:29:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 151 states have internal predecessors, (196), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:29:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 264 transitions. [2023-12-16 04:29:34,215 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 264 transitions. Word has length 106 [2023-12-16 04:29:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:34,216 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 264 transitions. [2023-12-16 04:29:34,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 264 transitions. [2023-12-16 04:29:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:29:34,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:34,217 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:34,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:29:34,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:34,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1475694180, now seen corresponding path program 1 times [2023-12-16 04:29:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752071424] [2023-12-16 04:29:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752071424] [2023-12-16 04:29:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752071424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:34,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:29:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838823566] [2023-12-16 04:29:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:29:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:29:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:34,288 INFO L87 Difference]: Start difference. First operand 189 states and 264 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:34,315 INFO L93 Difference]: Finished difference Result 401 states and 559 transitions. [2023-12-16 04:29:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:29:34,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2023-12-16 04:29:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:34,317 INFO L225 Difference]: With dead ends: 401 [2023-12-16 04:29:34,317 INFO L226 Difference]: Without dead ends: 225 [2023-12-16 04:29:34,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:34,319 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:34,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 218 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-16 04:29:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 191. [2023-12-16 04:29:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 153 states have internal predecessors, (198), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:29:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 266 transitions. [2023-12-16 04:29:34,343 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 266 transitions. Word has length 108 [2023-12-16 04:29:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:34,343 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 266 transitions. [2023-12-16 04:29:34,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 266 transitions. [2023-12-16 04:29:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:29:34,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:34,344 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:34,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:29:34,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:34,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1217528742, now seen corresponding path program 1 times [2023-12-16 04:29:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:34,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772965266] [2023-12-16 04:29:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772965266] [2023-12-16 04:29:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772965266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973375303] [2023-12-16 04:29:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:34,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:34,463 INFO L87 Difference]: Start difference. First operand 191 states and 266 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:34,510 INFO L93 Difference]: Finished difference Result 399 states and 555 transitions. [2023-12-16 04:29:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2023-12-16 04:29:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:34,511 INFO L225 Difference]: With dead ends: 399 [2023-12-16 04:29:34,512 INFO L226 Difference]: Without dead ends: 221 [2023-12-16 04:29:34,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:34,515 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:34,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 401 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-16 04:29:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2023-12-16 04:29:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 159 states have internal predecessors, (204), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 04:29:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 272 transitions. [2023-12-16 04:29:34,535 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 272 transitions. Word has length 108 [2023-12-16 04:29:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:34,535 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 272 transitions. [2023-12-16 04:29:34,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 272 transitions. [2023-12-16 04:29:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:29:34,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:34,537 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:34,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:29:34,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:34,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1897635123, now seen corresponding path program 1 times [2023-12-16 04:29:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:34,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522137847] [2023-12-16 04:29:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522137847] [2023-12-16 04:29:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522137847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:29:35,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656286003] [2023-12-16 04:29:35,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:35,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:29:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:29:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:29:35,663 INFO L87 Difference]: Start difference. First operand 197 states and 272 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:37,479 INFO L93 Difference]: Finished difference Result 521 states and 714 transitions. [2023-12-16 04:29:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 04:29:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 108 [2023-12-16 04:29:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:37,481 INFO L225 Difference]: With dead ends: 521 [2023-12-16 04:29:37,481 INFO L226 Difference]: Without dead ends: 417 [2023-12-16 04:29:37,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2023-12-16 04:29:37,482 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 400 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:37,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 558 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 04:29:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-16 04:29:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 189. [2023-12-16 04:29:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 156 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:29:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 260 transitions. [2023-12-16 04:29:37,506 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 260 transitions. Word has length 108 [2023-12-16 04:29:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:37,507 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 260 transitions. [2023-12-16 04:29:37,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 260 transitions. [2023-12-16 04:29:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:29:37,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:37,508 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:37,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:29:37,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:37,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1376263819, now seen corresponding path program 1 times [2023-12-16 04:29:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264574127] [2023-12-16 04:29:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264574127] [2023-12-16 04:29:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264574127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:29:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235989572] [2023-12-16 04:29:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:40,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:29:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:29:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:40,207 INFO L87 Difference]: Start difference. First operand 189 states and 260 transitions. Second operand has 10 states, 7 states have (on average 5.857142857142857) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:29:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:40,536 INFO L93 Difference]: Finished difference Result 334 states and 461 transitions. [2023-12-16 04:29:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:29:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 5.857142857142857) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 108 [2023-12-16 04:29:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:40,538 INFO L225 Difference]: With dead ends: 334 [2023-12-16 04:29:40,538 INFO L226 Difference]: Without dead ends: 226 [2023-12-16 04:29:40,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:29:40,539 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 184 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:40,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 639 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-16 04:29:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 189. [2023-12-16 04:29:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 156 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:29:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 260 transitions. [2023-12-16 04:29:40,561 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 260 transitions. Word has length 108 [2023-12-16 04:29:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:40,562 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 260 transitions. [2023-12-16 04:29:40,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 5.857142857142857) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:29:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 260 transitions. [2023-12-16 04:29:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:29:40,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:40,563 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:40,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:29:40,563 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:40,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1579683723, now seen corresponding path program 1 times [2023-12-16 04:29:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262757468] [2023-12-16 04:29:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:41,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262757468] [2023-12-16 04:29:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262757468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:41,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:41,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:29:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095416648] [2023-12-16 04:29:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:41,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:29:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:41,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:29:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:29:41,128 INFO L87 Difference]: Start difference. First operand 189 states and 260 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:41,726 INFO L93 Difference]: Finished difference Result 445 states and 607 transitions. [2023-12-16 04:29:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:29:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2023-12-16 04:29:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:41,728 INFO L225 Difference]: With dead ends: 445 [2023-12-16 04:29:41,728 INFO L226 Difference]: Without dead ends: 337 [2023-12-16 04:29:41,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:29:41,729 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 364 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:41,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 306 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:29:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-12-16 04:29:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 177. [2023-12-16 04:29:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:29:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 241 transitions. [2023-12-16 04:29:41,756 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 241 transitions. Word has length 108 [2023-12-16 04:29:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 241 transitions. [2023-12-16 04:29:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 241 transitions. [2023-12-16 04:29:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:29:41,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:41,757 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:41,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:29:41,757 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:41,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1541036681, now seen corresponding path program 1 times [2023-12-16 04:29:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610821831] [2023-12-16 04:29:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610821831] [2023-12-16 04:29:42,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610821831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:29:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467796896] [2023-12-16 04:29:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:29:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:42,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:29:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:29:42,482 INFO L87 Difference]: Start difference. First operand 177 states and 241 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:43,215 INFO L93 Difference]: Finished difference Result 484 states and 658 transitions. [2023-12-16 04:29:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-16 04:29:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2023-12-16 04:29:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:43,217 INFO L225 Difference]: With dead ends: 484 [2023-12-16 04:29:43,217 INFO L226 Difference]: Without dead ends: 388 [2023-12-16 04:29:43,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2023-12-16 04:29:43,218 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 364 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:43,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 705 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:29:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-16 04:29:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 190. [2023-12-16 04:29:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 157 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:29:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2023-12-16 04:29:43,243 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 110 [2023-12-16 04:29:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:43,244 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2023-12-16 04:29:43,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2023-12-16 04:29:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:29:43,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:43,244 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:43,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:29:43,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:43,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1069309923, now seen corresponding path program 1 times [2023-12-16 04:29:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:43,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088777550] [2023-12-16 04:29:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088777550] [2023-12-16 04:29:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088777550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:44,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:44,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:29:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750278841] [2023-12-16 04:29:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:44,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:29:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:44,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:29:44,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:44,042 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:44,676 INFO L93 Difference]: Finished difference Result 413 states and 566 transitions. [2023-12-16 04:29:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:29:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 110 [2023-12-16 04:29:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:44,680 INFO L225 Difference]: With dead ends: 413 [2023-12-16 04:29:44,680 INFO L226 Difference]: Without dead ends: 304 [2023-12-16 04:29:44,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:29:44,681 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 283 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:44,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 504 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:29:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-12-16 04:29:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 236. [2023-12-16 04:29:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 198 states have (on average 1.3181818181818181) internal successors, (261), 199 states have internal predecessors, (261), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:29:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 325 transitions. [2023-12-16 04:29:44,712 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 325 transitions. Word has length 110 [2023-12-16 04:29:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:44,713 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 325 transitions. [2023-12-16 04:29:44,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 325 transitions. [2023-12-16 04:29:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:29:44,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:44,714 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:44,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:29:44,714 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:44,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -475173374, now seen corresponding path program 1 times [2023-12-16 04:29:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898987407] [2023-12-16 04:29:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:45,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:45,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898987407] [2023-12-16 04:29:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898987407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:45,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676333716] [2023-12-16 04:29:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:45,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:45,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:45,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:45,038 INFO L87 Difference]: Start difference. First operand 236 states and 325 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:45,248 INFO L93 Difference]: Finished difference Result 526 states and 722 transitions. [2023-12-16 04:29:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2023-12-16 04:29:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:45,251 INFO L225 Difference]: With dead ends: 526 [2023-12-16 04:29:45,251 INFO L226 Difference]: Without dead ends: 303 [2023-12-16 04:29:45,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:45,252 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:45,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 256 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-12-16 04:29:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2023-12-16 04:29:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.321285140562249) internal successors, (329), 250 states have internal predecessors, (329), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:29:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 393 transitions. [2023-12-16 04:29:45,284 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 393 transitions. Word has length 111 [2023-12-16 04:29:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:45,285 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 393 transitions. [2023-12-16 04:29:45,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 393 transitions. [2023-12-16 04:29:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:29:45,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:45,286 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:45,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:29:45,286 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:45,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1292821824, now seen corresponding path program 1 times [2023-12-16 04:29:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:45,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408928578] [2023-12-16 04:29:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:45,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408928578] [2023-12-16 04:29:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408928578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:29:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758530554] [2023-12-16 04:29:45,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:45,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:29:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:45,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:29:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:45,742 INFO L87 Difference]: Start difference. First operand 288 states and 393 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:46,245 INFO L93 Difference]: Finished difference Result 665 states and 901 transitions. [2023-12-16 04:29:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:29:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2023-12-16 04:29:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:46,247 INFO L225 Difference]: With dead ends: 665 [2023-12-16 04:29:46,247 INFO L226 Difference]: Without dead ends: 378 [2023-12-16 04:29:46,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:29:46,248 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 262 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:46,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 397 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:29:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-16 04:29:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 287. [2023-12-16 04:29:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 248 states have (on average 1.3185483870967742) internal successors, (327), 249 states have internal predecessors, (327), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:29:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 391 transitions. [2023-12-16 04:29:46,279 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 391 transitions. Word has length 111 [2023-12-16 04:29:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:46,280 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 391 transitions. [2023-12-16 04:29:46,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 391 transitions. [2023-12-16 04:29:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:29:46,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:46,281 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:46,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:29:46,281 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:46,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1317524780, now seen corresponding path program 1 times [2023-12-16 04:29:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336465489] [2023-12-16 04:29:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336465489] [2023-12-16 04:29:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336465489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113923464] [2023-12-16 04:29:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:46,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:46,628 INFO L87 Difference]: Start difference. First operand 287 states and 391 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:46,780 INFO L93 Difference]: Finished difference Result 578 states and 785 transitions. [2023-12-16 04:29:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:29:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2023-12-16 04:29:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:46,782 INFO L225 Difference]: With dead ends: 578 [2023-12-16 04:29:46,782 INFO L226 Difference]: Without dead ends: 292 [2023-12-16 04:29:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:46,783 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 71 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:46,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:29:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-16 04:29:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2023-12-16 04:29:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 248 states have (on average 1.314516129032258) internal successors, (326), 249 states have internal predecessors, (326), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:29:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 390 transitions. [2023-12-16 04:29:46,813 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 390 transitions. Word has length 111 [2023-12-16 04:29:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:46,814 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 390 transitions. [2023-12-16 04:29:46,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 390 transitions. [2023-12-16 04:29:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:29:46,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:46,814 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:46,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:29:46,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:46,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1991028222, now seen corresponding path program 1 times [2023-12-16 04:29:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:46,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864327497] [2023-12-16 04:29:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:47,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864327497] [2023-12-16 04:29:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864327497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100050604] [2023-12-16 04:29:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:47,200 INFO L87 Difference]: Start difference. First operand 287 states and 390 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:47,436 INFO L93 Difference]: Finished difference Result 591 states and 801 transitions. [2023-12-16 04:29:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2023-12-16 04:29:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:47,442 INFO L225 Difference]: With dead ends: 591 [2023-12-16 04:29:47,442 INFO L226 Difference]: Without dead ends: 305 [2023-12-16 04:29:47,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:47,443 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 181 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:47,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 303 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-16 04:29:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 275. [2023-12-16 04:29:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 237 states have internal predecessors, (307), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:29:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 371 transitions. [2023-12-16 04:29:47,474 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 371 transitions. Word has length 111 [2023-12-16 04:29:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:47,475 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 371 transitions. [2023-12-16 04:29:47,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2023-12-16 04:29:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:47,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:47,476 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:47,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:29:47,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:47,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash -584174144, now seen corresponding path program 1 times [2023-12-16 04:29:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:47,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885009666] [2023-12-16 04:29:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885009666] [2023-12-16 04:29:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885009666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:29:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122420803] [2023-12-16 04:29:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:48,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:29:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:29:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:48,478 INFO L87 Difference]: Start difference. First operand 275 states and 371 transitions. Second operand has 10 states, 8 states have (on average 5.625) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:48,869 INFO L93 Difference]: Finished difference Result 304 states and 406 transitions. [2023-12-16 04:29:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:29:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.625) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2023-12-16 04:29:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:48,871 INFO L225 Difference]: With dead ends: 304 [2023-12-16 04:29:48,871 INFO L226 Difference]: Without dead ends: 302 [2023-12-16 04:29:48,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:29:48,872 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 209 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:48,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 420 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-16 04:29:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 281. [2023-12-16 04:29:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 242 states have (on average 1.2933884297520661) internal successors, (313), 243 states have internal predecessors, (313), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:29:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 377 transitions. [2023-12-16 04:29:48,902 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 377 transitions. Word has length 112 [2023-12-16 04:29:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:48,902 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 377 transitions. [2023-12-16 04:29:48,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.625) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 377 transitions. [2023-12-16 04:29:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:48,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:48,903 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:48,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 04:29:48,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:48,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -584114562, now seen corresponding path program 1 times [2023-12-16 04:29:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792200949] [2023-12-16 04:29:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792200949] [2023-12-16 04:29:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792200949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900705850] [2023-12-16 04:29:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:49,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:49,306 INFO L87 Difference]: Start difference. First operand 281 states and 377 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:49,601 INFO L93 Difference]: Finished difference Result 602 states and 802 transitions. [2023-12-16 04:29:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-12-16 04:29:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:49,603 INFO L225 Difference]: With dead ends: 602 [2023-12-16 04:29:49,603 INFO L226 Difference]: Without dead ends: 322 [2023-12-16 04:29:49,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:49,604 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 78 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:49,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 363 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-16 04:29:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2023-12-16 04:29:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 266 states have (on average 1.255639097744361) internal successors, (334), 268 states have internal predecessors, (334), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 04:29:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 422 transitions. [2023-12-16 04:29:49,652 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 422 transitions. Word has length 112 [2023-12-16 04:29:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:49,652 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 422 transitions. [2023-12-16 04:29:49,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 422 transitions. [2023-12-16 04:29:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:49,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:49,653 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:49,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:29:49,653 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:49,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash -526856260, now seen corresponding path program 1 times [2023-12-16 04:29:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353682713] [2023-12-16 04:29:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353682713] [2023-12-16 04:29:50,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353682713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:50,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:50,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:29:50,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757950247] [2023-12-16 04:29:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:50,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:29:50,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:50,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:29:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:50,185 INFO L87 Difference]: Start difference. First operand 321 states and 422 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:50,419 INFO L93 Difference]: Finished difference Result 615 states and 804 transitions. [2023-12-16 04:29:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:29:50,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2023-12-16 04:29:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:50,422 INFO L225 Difference]: With dead ends: 615 [2023-12-16 04:29:50,422 INFO L226 Difference]: Without dead ends: 438 [2023-12-16 04:29:50,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:50,423 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 55 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:50,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 470 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2023-12-16 04:29:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 394. [2023-12-16 04:29:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 339 states have (on average 1.2595870206489677) internal successors, (427), 341 states have internal predecessors, (427), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 04:29:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 515 transitions. [2023-12-16 04:29:50,467 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 515 transitions. Word has length 112 [2023-12-16 04:29:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:50,467 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 515 transitions. [2023-12-16 04:29:50,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 515 transitions. [2023-12-16 04:29:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:29:50,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:50,469 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:50,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:29:50,469 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:50,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash -533105034, now seen corresponding path program 1 times [2023-12-16 04:29:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:50,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178917737] [2023-12-16 04:29:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178917737] [2023-12-16 04:29:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178917737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:29:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135813724] [2023-12-16 04:29:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:50,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:29:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:29:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:50,653 INFO L87 Difference]: Start difference. First operand 394 states and 515 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:51,053 INFO L93 Difference]: Finished difference Result 778 states and 1011 transitions. [2023-12-16 04:29:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:29:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2023-12-16 04:29:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:51,056 INFO L225 Difference]: With dead ends: 778 [2023-12-16 04:29:51,056 INFO L226 Difference]: Without dead ends: 540 [2023-12-16 04:29:51,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:29:51,058 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 264 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:51,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 341 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-12-16 04:29:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 410. [2023-12-16 04:29:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 352 states have (on average 1.25) internal successors, (440), 354 states have internal predecessors, (440), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:29:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 532 transitions. [2023-12-16 04:29:51,103 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 532 transitions. Word has length 113 [2023-12-16 04:29:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:51,104 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 532 transitions. [2023-12-16 04:29:51,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 532 transitions. [2023-12-16 04:29:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:29:51,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:51,105 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:51,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:29:51,106 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:51,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2121452936, now seen corresponding path program 1 times [2023-12-16 04:29:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098626095] [2023-12-16 04:29:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098626095] [2023-12-16 04:29:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098626095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:29:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883015038] [2023-12-16 04:29:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:51,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:29:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:29:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:51,459 INFO L87 Difference]: Start difference. First operand 410 states and 532 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:51,954 INFO L93 Difference]: Finished difference Result 729 states and 947 transitions. [2023-12-16 04:29:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:29:51,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-16 04:29:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:51,956 INFO L225 Difference]: With dead ends: 729 [2023-12-16 04:29:51,956 INFO L226 Difference]: Without dead ends: 491 [2023-12-16 04:29:51,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:29:51,957 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 299 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:51,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 382 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:29:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-16 04:29:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 410. [2023-12-16 04:29:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 352 states have (on average 1.2443181818181819) internal successors, (438), 354 states have internal predecessors, (438), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:29:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2023-12-16 04:29:52,000 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 113 [2023-12-16 04:29:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2023-12-16 04:29:52,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2023-12-16 04:29:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:29:52,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:52,001 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:52,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 04:29:52,001 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:52,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -162527700, now seen corresponding path program 1 times [2023-12-16 04:29:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672757803] [2023-12-16 04:29:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:52,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:52,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672757803] [2023-12-16 04:29:52,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672757803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:52,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:52,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:29:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121493892] [2023-12-16 04:29:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:52,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:29:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:29:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:52,374 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:52,849 INFO L93 Difference]: Finished difference Result 728 states and 944 transitions. [2023-12-16 04:29:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:29:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-16 04:29:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:52,854 INFO L225 Difference]: With dead ends: 728 [2023-12-16 04:29:52,854 INFO L226 Difference]: Without dead ends: 486 [2023-12-16 04:29:52,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:29:52,856 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 165 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:52,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 425 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:29:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-12-16 04:29:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 406. [2023-12-16 04:29:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 348 states have (on average 1.2413793103448276) internal successors, (432), 350 states have internal predecessors, (432), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:29:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 524 transitions. [2023-12-16 04:29:52,899 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 524 transitions. Word has length 113 [2023-12-16 04:29:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:52,899 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 524 transitions. [2023-12-16 04:29:52,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 524 transitions. [2023-12-16 04:29:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:29:52,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:52,900 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:52,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 04:29:52,900 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:52,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1173644950, now seen corresponding path program 1 times [2023-12-16 04:29:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454506862] [2023-12-16 04:29:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:53,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:53,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454506862] [2023-12-16 04:29:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454506862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:29:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556496836] [2023-12-16 04:29:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:53,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:29:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:53,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:29:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:29:53,350 INFO L87 Difference]: Start difference. First operand 406 states and 524 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:53,972 INFO L93 Difference]: Finished difference Result 725 states and 939 transitions. [2023-12-16 04:29:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:29:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2023-12-16 04:29:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:53,975 INFO L225 Difference]: With dead ends: 725 [2023-12-16 04:29:53,975 INFO L226 Difference]: Without dead ends: 487 [2023-12-16 04:29:53,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:29:53,975 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 228 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:53,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 441 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:29:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2023-12-16 04:29:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 410. [2023-12-16 04:29:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 352 states have (on average 1.2386363636363635) internal successors, (436), 354 states have internal predecessors, (436), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:29:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 528 transitions. [2023-12-16 04:29:54,018 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 528 transitions. Word has length 113 [2023-12-16 04:29:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:54,018 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 528 transitions. [2023-12-16 04:29:54,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 528 transitions. [2023-12-16 04:29:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:54,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:54,019 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:54,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 04:29:54,019 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:54,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 103281636, now seen corresponding path program 1 times [2023-12-16 04:29:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352251209] [2023-12-16 04:29:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:54,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352251209] [2023-12-16 04:29:54,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352251209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:54,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:54,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:29:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115217681] [2023-12-16 04:29:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:54,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:29:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:54,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:29:54,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:54,632 INFO L87 Difference]: Start difference. First operand 410 states and 528 transitions. Second operand has 7 states, 5 states have (on average 9.4) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:54,897 INFO L93 Difference]: Finished difference Result 728 states and 930 transitions. [2023-12-16 04:29:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:29:54,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2023-12-16 04:29:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:54,899 INFO L225 Difference]: With dead ends: 728 [2023-12-16 04:29:54,899 INFO L226 Difference]: Without dead ends: 490 [2023-12-16 04:29:54,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:54,900 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 71 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:54,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 432 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-16 04:29:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 468. [2023-12-16 04:29:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 402 states have (on average 1.2238805970149254) internal successors, (492), 406 states have internal predecessors, (492), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 592 transitions. [2023-12-16 04:29:54,957 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 592 transitions. Word has length 114 [2023-12-16 04:29:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:54,957 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 592 transitions. [2023-12-16 04:29:54,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 592 transitions. [2023-12-16 04:29:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:54,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:54,958 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:54,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 04:29:54,958 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:54,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash -258381462, now seen corresponding path program 1 times [2023-12-16 04:29:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409640218] [2023-12-16 04:29:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409640218] [2023-12-16 04:29:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409640218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:54,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:54,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:29:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498706882] [2023-12-16 04:29:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:54,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:29:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:54,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:29:54,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:54,997 INFO L87 Difference]: Start difference. First operand 468 states and 592 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:55,058 INFO L93 Difference]: Finished difference Result 946 states and 1194 transitions. [2023-12-16 04:29:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:29:55,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-16 04:29:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:55,060 INFO L225 Difference]: With dead ends: 946 [2023-12-16 04:29:55,060 INFO L226 Difference]: Without dead ends: 523 [2023-12-16 04:29:55,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:55,062 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:55,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 214 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-12-16 04:29:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 473. [2023-12-16 04:29:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 407 states have (on average 1.221130221130221) internal successors, (497), 411 states have internal predecessors, (497), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 597 transitions. [2023-12-16 04:29:55,121 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 597 transitions. Word has length 114 [2023-12-16 04:29:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:55,121 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 597 transitions. [2023-12-16 04:29:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 597 transitions. [2023-12-16 04:29:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:55,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:55,122 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:55,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 04:29:55,122 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:55,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 134645548, now seen corresponding path program 1 times [2023-12-16 04:29:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391832810] [2023-12-16 04:29:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:55,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:55,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391832810] [2023-12-16 04:29:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391832810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055345148] [2023-12-16 04:29:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:55,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:55,442 INFO L87 Difference]: Start difference. First operand 473 states and 597 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:55,672 INFO L93 Difference]: Finished difference Result 951 states and 1193 transitions. [2023-12-16 04:29:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:55,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-12-16 04:29:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:55,678 INFO L225 Difference]: With dead ends: 951 [2023-12-16 04:29:55,678 INFO L226 Difference]: Without dead ends: 523 [2023-12-16 04:29:55,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:55,679 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 132 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:55,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 284 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-12-16 04:29:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 470. [2023-12-16 04:29:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 404 states have (on average 1.2153465346534653) internal successors, (491), 408 states have internal predecessors, (491), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 591 transitions. [2023-12-16 04:29:55,733 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 591 transitions. Word has length 114 [2023-12-16 04:29:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:55,733 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 591 transitions. [2023-12-16 04:29:55,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:29:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 591 transitions. [2023-12-16 04:29:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:55,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:55,734 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:55,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 04:29:55,734 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:55,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash 442683116, now seen corresponding path program 1 times [2023-12-16 04:29:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695869308] [2023-12-16 04:29:55,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695869308] [2023-12-16 04:29:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695869308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:29:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127935198] [2023-12-16 04:29:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:56,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:29:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:29:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:56,014 INFO L87 Difference]: Start difference. First operand 470 states and 591 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:56,376 INFO L93 Difference]: Finished difference Result 1113 states and 1385 transitions. [2023-12-16 04:29:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-16 04:29:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:56,379 INFO L225 Difference]: With dead ends: 1113 [2023-12-16 04:29:56,379 INFO L226 Difference]: Without dead ends: 688 [2023-12-16 04:29:56,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:29:56,382 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 294 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:56,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 406 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-12-16 04:29:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 574. [2023-12-16 04:29:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 508 states have (on average 1.2244094488188977) internal successors, (622), 511 states have internal predecessors, (622), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 722 transitions. [2023-12-16 04:29:56,454 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 722 transitions. Word has length 114 [2023-12-16 04:29:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:56,454 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 722 transitions. [2023-12-16 04:29:56,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 722 transitions. [2023-12-16 04:29:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:56,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:56,455 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:56,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 04:29:56,456 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:56,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 835710126, now seen corresponding path program 1 times [2023-12-16 04:29:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:56,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018846356] [2023-12-16 04:29:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:56,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018846356] [2023-12-16 04:29:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018846356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:29:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221204090] [2023-12-16 04:29:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:56,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:29:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:29:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:56,891 INFO L87 Difference]: Start difference. First operand 574 states and 722 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:57,316 INFO L93 Difference]: Finished difference Result 1109 states and 1385 transitions. [2023-12-16 04:29:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:29:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-16 04:29:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:57,320 INFO L225 Difference]: With dead ends: 1109 [2023-12-16 04:29:57,320 INFO L226 Difference]: Without dead ends: 684 [2023-12-16 04:29:57,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:29:57,322 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 158 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:57,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 649 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-12-16 04:29:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 602. [2023-12-16 04:29:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 536 states have (on average 1.2145522388059702) internal successors, (651), 539 states have internal predecessors, (651), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 751 transitions. [2023-12-16 04:29:57,381 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 751 transitions. Word has length 114 [2023-12-16 04:29:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:57,382 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 751 transitions. [2023-12-16 04:29:57,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 751 transitions. [2023-12-16 04:29:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:57,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:57,383 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:57,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 04:29:57,383 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:57,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1054564844, now seen corresponding path program 1 times [2023-12-16 04:29:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891288289] [2023-12-16 04:29:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891288289] [2023-12-16 04:29:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891288289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563202745] [2023-12-16 04:29:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:57,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:57,590 INFO L87 Difference]: Start difference. First operand 602 states and 751 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:57,885 INFO L93 Difference]: Finished difference Result 1129 states and 1404 transitions. [2023-12-16 04:29:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-12-16 04:29:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:57,887 INFO L225 Difference]: With dead ends: 1129 [2023-12-16 04:29:57,887 INFO L226 Difference]: Without dead ends: 645 [2023-12-16 04:29:57,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:57,889 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 145 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:57,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 300 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2023-12-16 04:29:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 596. [2023-12-16 04:29:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 530 states have (on average 1.209433962264151) internal successors, (641), 533 states have internal predecessors, (641), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 741 transitions. [2023-12-16 04:29:57,944 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 741 transitions. Word has length 114 [2023-12-16 04:29:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:57,944 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 741 transitions. [2023-12-16 04:29:57,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:29:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 741 transitions. [2023-12-16 04:29:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 04:29:57,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:57,945 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:57,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 04:29:57,945 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:57,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1535602200, now seen corresponding path program 1 times [2023-12-16 04:29:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033884953] [2023-12-16 04:29:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:58,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:58,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033884953] [2023-12-16 04:29:58,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033884953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:58,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:58,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:29:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096470843] [2023-12-16 04:29:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:58,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:29:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:29:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:58,466 INFO L87 Difference]: Start difference. First operand 596 states and 741 transitions. Second operand has 7 states, 5 states have (on average 9.6) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:58,724 INFO L93 Difference]: Finished difference Result 888 states and 1108 transitions. [2023-12-16 04:29:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.6) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2023-12-16 04:29:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:58,728 INFO L225 Difference]: With dead ends: 888 [2023-12-16 04:29:58,728 INFO L226 Difference]: Without dead ends: 594 [2023-12-16 04:29:58,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:58,730 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 44 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:58,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 420 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2023-12-16 04:29:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 522. [2023-12-16 04:29:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 460 states have (on average 1.208695652173913) internal successors, (556), 461 states have internal predecessors, (556), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:29:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 648 transitions. [2023-12-16 04:29:58,782 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 648 transitions. Word has length 115 [2023-12-16 04:29:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:58,783 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 648 transitions. [2023-12-16 04:29:58,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.6) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:29:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 648 transitions. [2023-12-16 04:29:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 04:29:58,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:58,783 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:58,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 04:29:58,783 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:58,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 857282979, now seen corresponding path program 1 times [2023-12-16 04:29:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:58,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201616461] [2023-12-16 04:29:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:29:59,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:59,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201616461] [2023-12-16 04:29:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201616461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:59,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-16 04:29:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328474869] [2023-12-16 04:29:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:59,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 04:29:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 04:29:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:29:59,663 INFO L87 Difference]: Start difference. First operand 522 states and 648 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:30:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:01,216 INFO L93 Difference]: Finished difference Result 1170 states and 1455 transitions. [2023-12-16 04:30:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-16 04:30:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2023-12-16 04:30:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:01,219 INFO L225 Difference]: With dead ends: 1170 [2023-12-16 04:30:01,219 INFO L226 Difference]: Without dead ends: 920 [2023-12-16 04:30:01,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 04:30:01,220 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 398 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:01,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1344 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:30:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2023-12-16 04:30:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 721. [2023-12-16 04:30:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 648 states have (on average 1.2237654320987654) internal successors, (793), 650 states have internal predecessors, (793), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 901 transitions. [2023-12-16 04:30:01,286 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 901 transitions. Word has length 116 [2023-12-16 04:30:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:01,286 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 901 transitions. [2023-12-16 04:30:01,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:30:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 901 transitions. [2023-12-16 04:30:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:30:01,287 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:01,287 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:01,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 04:30:01,287 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:01,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash 671611120, now seen corresponding path program 1 times [2023-12-16 04:30:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:01,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240590928] [2023-12-16 04:30:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240590928] [2023-12-16 04:30:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240590928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:30:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873999497] [2023-12-16 04:30:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:01,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:30:01,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:01,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:30:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:30:01,773 INFO L87 Difference]: Start difference. First operand 721 states and 901 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:30:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:02,300 INFO L93 Difference]: Finished difference Result 1471 states and 1841 transitions. [2023-12-16 04:30:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:30:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2023-12-16 04:30:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:02,303 INFO L225 Difference]: With dead ends: 1471 [2023-12-16 04:30:02,303 INFO L226 Difference]: Without dead ends: 1101 [2023-12-16 04:30:02,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:30:02,304 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 116 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:02,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 894 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:30:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-12-16 04:30:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 850. [2023-12-16 04:30:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 777 states have (on average 1.229086229086229) internal successors, (955), 779 states have internal predecessors, (955), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1063 transitions. [2023-12-16 04:30:02,374 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1063 transitions. Word has length 117 [2023-12-16 04:30:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:02,374 INFO L495 AbstractCegarLoop]: Abstraction has 850 states and 1063 transitions. [2023-12-16 04:30:02,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:30:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1063 transitions. [2023-12-16 04:30:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:02,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:02,375 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 04:30:02,375 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:02,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 119339657, now seen corresponding path program 1 times [2023-12-16 04:30:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229663530] [2023-12-16 04:30:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229663530] [2023-12-16 04:30:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229663530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:03,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:30:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996134886] [2023-12-16 04:30:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:03,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:30:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:30:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:03,192 INFO L87 Difference]: Start difference. First operand 850 states and 1063 transitions. Second operand has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:30:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:03,969 INFO L93 Difference]: Finished difference Result 1627 states and 2062 transitions. [2023-12-16 04:30:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:30:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2023-12-16 04:30:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:03,972 INFO L225 Difference]: With dead ends: 1627 [2023-12-16 04:30:03,972 INFO L226 Difference]: Without dead ends: 1151 [2023-12-16 04:30:03,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:30:03,974 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 149 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:03,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 725 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-12-16 04:30:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 970. [2023-12-16 04:30:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 897 states have (on average 1.2408026755852843) internal successors, (1113), 899 states have internal predecessors, (1113), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1221 transitions. [2023-12-16 04:30:04,047 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1221 transitions. Word has length 118 [2023-12-16 04:30:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:04,048 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1221 transitions. [2023-12-16 04:30:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:30:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1221 transitions. [2023-12-16 04:30:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:04,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:04,049 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:04,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 04:30:04,050 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:04,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash -891777593, now seen corresponding path program 1 times [2023-12-16 04:30:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533354514] [2023-12-16 04:30:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533354514] [2023-12-16 04:30:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533354514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:04,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 04:30:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984223080] [2023-12-16 04:30:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:30:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:30:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:30:04,998 INFO L87 Difference]: Start difference. First operand 970 states and 1221 transitions. Second operand has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-16 04:30:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:06,120 INFO L93 Difference]: Finished difference Result 1715 states and 2184 transitions. [2023-12-16 04:30:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:30:06,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Word has length 118 [2023-12-16 04:30:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:06,124 INFO L225 Difference]: With dead ends: 1715 [2023-12-16 04:30:06,124 INFO L226 Difference]: Without dead ends: 1184 [2023-12-16 04:30:06,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-12-16 04:30:06,126 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 272 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:06,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 661 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:30:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2023-12-16 04:30:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 973. [2023-12-16 04:30:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 900 states have (on average 1.238888888888889) internal successors, (1115), 902 states have internal predecessors, (1115), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1223 transitions. [2023-12-16 04:30:06,254 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1223 transitions. Word has length 118 [2023-12-16 04:30:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:06,254 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1223 transitions. [2023-12-16 04:30:06,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.666666666666667) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-16 04:30:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1223 transitions. [2023-12-16 04:30:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:06,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:06,255 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:06,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 04:30:06,256 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 30284617, now seen corresponding path program 1 times [2023-12-16 04:30:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165819718] [2023-12-16 04:30:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165819718] [2023-12-16 04:30:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165819718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:07,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:30:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808031642] [2023-12-16 04:30:07,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:07,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:30:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:07,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:30:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:07,120 INFO L87 Difference]: Start difference. First operand 973 states and 1223 transitions. Second operand has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:30:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:07,947 INFO L93 Difference]: Finished difference Result 1863 states and 2365 transitions. [2023-12-16 04:30:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:30:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2023-12-16 04:30:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:07,951 INFO L225 Difference]: With dead ends: 1863 [2023-12-16 04:30:07,951 INFO L226 Difference]: Without dead ends: 1333 [2023-12-16 04:30:07,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:30:07,953 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 180 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:07,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 649 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-12-16 04:30:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1117. [2023-12-16 04:30:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1044 states have (on average 1.2452107279693487) internal successors, (1300), 1046 states have internal predecessors, (1300), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1408 transitions. [2023-12-16 04:30:08,031 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1408 transitions. Word has length 118 [2023-12-16 04:30:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:08,031 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1408 transitions. [2023-12-16 04:30:08,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-16 04:30:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1408 transitions. [2023-12-16 04:30:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:08,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:08,033 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:08,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 04:30:08,033 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:08,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash -990783737, now seen corresponding path program 1 times [2023-12-16 04:30:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217078877] [2023-12-16 04:30:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217078877] [2023-12-16 04:30:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217078877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:30:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803759105] [2023-12-16 04:30:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:08,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:08,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:08,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:08,175 INFO L87 Difference]: Start difference. First operand 1117 states and 1408 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:30:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:08,529 INFO L93 Difference]: Finished difference Result 2366 states and 2984 transitions. [2023-12-16 04:30:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:30:08,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-16 04:30:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:08,534 INFO L225 Difference]: With dead ends: 2366 [2023-12-16 04:30:08,534 INFO L226 Difference]: Without dead ends: 1764 [2023-12-16 04:30:08,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:30:08,535 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 126 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:08,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 360 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2023-12-16 04:30:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1142. [2023-12-16 04:30:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1069 states have (on average 1.2525724976613657) internal successors, (1339), 1071 states have internal predecessors, (1339), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1447 transitions. [2023-12-16 04:30:08,616 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1447 transitions. Word has length 118 [2023-12-16 04:30:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:08,616 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1447 transitions. [2023-12-16 04:30:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-16 04:30:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1447 transitions. [2023-12-16 04:30:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:08,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:08,617 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:08,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 04:30:08,617 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:08,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2001900987, now seen corresponding path program 1 times [2023-12-16 04:30:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174865555] [2023-12-16 04:30:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174865555] [2023-12-16 04:30:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174865555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:09,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:09,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:30:09,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347209690] [2023-12-16 04:30:09,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:09,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:30:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:09,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:30:09,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:09,239 INFO L87 Difference]: Start difference. First operand 1142 states and 1447 transitions. Second operand has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:30:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:10,127 INFO L93 Difference]: Finished difference Result 2329 states and 2952 transitions. [2023-12-16 04:30:10,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 04:30:10,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2023-12-16 04:30:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:10,132 INFO L225 Difference]: With dead ends: 2329 [2023-12-16 04:30:10,132 INFO L226 Difference]: Without dead ends: 1707 [2023-12-16 04:30:10,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:30:10,134 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 306 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:10,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 575 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2023-12-16 04:30:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1147. [2023-12-16 04:30:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1074 states have (on average 1.2495344506517692) internal successors, (1342), 1076 states have internal predecessors, (1342), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 04:30:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1450 transitions. [2023-12-16 04:30:10,239 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1450 transitions. Word has length 118 [2023-12-16 04:30:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:10,239 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1450 transitions. [2023-12-16 04:30:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:30:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1450 transitions. [2023-12-16 04:30:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:10,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:10,240 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:10,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 04:30:10,240 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:10,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1945019461, now seen corresponding path program 1 times [2023-12-16 04:30:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994876288] [2023-12-16 04:30:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:30:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:30:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:30:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:30:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-16 04:30:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994876288] [2023-12-16 04:30:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994876288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-16 04:30:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960620945] [2023-12-16 04:30:12,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:12,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 04:30:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 04:30:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:30:12,409 INFO L87 Difference]: Start difference. First operand 1147 states and 1450 transitions. Second operand has 19 states, 15 states have (on average 3.4) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 5 states have call successors, (14) Received shutdown request... [2023-12-16 04:30:13,802 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:30:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:30:13,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2023-12-16 04:30:13,871 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 42 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:13,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 581 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:30:13,873 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:30:13,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-16 04:30:13,874 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1147states) and FLOYD_HOARE automaton (currently 13 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (97 states constructed, input type IntersectNwa). [2023-12-16 04:30:13,879 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:13,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:30:13,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:30:13 BoogieIcfgContainer [2023-12-16 04:30:13,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:30:13,883 INFO L158 Benchmark]: Toolchain (without parser) took 48096.24ms. Allocated memory was 305.1MB in the beginning and 914.4MB in the end (delta: 609.2MB). Free memory was 262.3MB in the beginning and 776.7MB in the end (delta: -514.5MB). Peak memory consumption was 95.3MB. Max. memory is 8.0GB. [2023-12-16 04:30:13,883 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:30:13,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.16ms. Allocated memory is still 305.1MB. Free memory was 262.3MB in the beginning and 246.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:30:13,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.23ms. Allocated memory is still 305.1MB. Free memory was 246.0MB in the beginning and 241.3MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:30:13,883 INFO L158 Benchmark]: Boogie Preprocessor took 84.74ms. Allocated memory is still 305.1MB. Free memory was 241.3MB in the beginning and 236.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:30:13,884 INFO L158 Benchmark]: RCFGBuilder took 478.76ms. Allocated memory is still 305.1MB. Free memory was 236.0MB in the beginning and 205.1MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-16 04:30:13,884 INFO L158 Benchmark]: TraceAbstraction took 47244.99ms. Allocated memory was 305.1MB in the beginning and 914.4MB in the end (delta: 609.2MB). Free memory was 204.1MB in the beginning and 776.7MB in the end (delta: -572.7MB). Peak memory consumption was 37.6MB. Max. memory is 8.0GB. [2023-12-16 04:30:13,884 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.10ms. Allocated memory is still 184.5MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.16ms. Allocated memory is still 305.1MB. Free memory was 262.3MB in the beginning and 246.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.23ms. Allocated memory is still 305.1MB. Free memory was 246.0MB in the beginning and 241.3MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.74ms. Allocated memory is still 305.1MB. Free memory was 241.3MB in the beginning and 236.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 478.76ms. Allocated memory is still 305.1MB. Free memory was 236.0MB in the beginning and 205.1MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 47244.99ms. Allocated memory was 305.1MB in the beginning and 914.4MB in the end (delta: 609.2MB). Free memory was 204.1MB in the beginning and 776.7MB in the end (delta: -572.7MB). Peak memory consumption was 37.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (1147states) and FLOYD_HOARE automaton (currently 13 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (97 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.2s, OverallIterations: 40, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7095 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7061 mSDsluCounter, 18278 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14410 mSDsCounter, 1698 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18787 IncrementalHoareTripleChecker+Invalid, 20485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1698 mSolverCounterUnsat, 3868 mSDtfsCounter, 18787 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1915 GetRequests, 1487 SyntacticMatches, 4 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1147occurred in iteration=39, InterpolantAutomatonStates: 389, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 4407 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 4465 NumberOfCodeBlocks, 4465 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4425 ConstructedInterpolants, 0 QuantifiedInterpolants, 27838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 14560/14560 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