/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-sp_file-66.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:33:35,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:33:35,787 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:33:35,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:33:35,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:33:35,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:33:35,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:33:35,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:33:35,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:33:35,817 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:33:35,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:33:35,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:33:35,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:33:35,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:33:35,818 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:33:35,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:33:35,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:33:35,819 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:33:35,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:33:35,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:33:35,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:33:35,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:33:35,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:33:35,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:33:35,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:33:35,821 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:33:35,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:33:35,821 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:33:35,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:33:35,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:33:35,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:33:35,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:33:35,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:33:35,823 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:33:35,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:33:35,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:33:35,824 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:33:36,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:33:36,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:33:36,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:33:36,041 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:33:36,041 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:33:36,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-66.i [2023-12-16 04:33:37,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:33:37,281 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:33:37,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-66.i [2023-12-16 04:33:37,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea57e76b/67156efcee5b48dd90b57b06d83900e6/FLAG0e02fea3d [2023-12-16 04:33:37,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea57e76b/67156efcee5b48dd90b57b06d83900e6 [2023-12-16 04:33:37,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:33:37,304 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:33:37,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:33:37,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:33:37,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:33:37,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59612a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37, skipping insertion in model container [2023-12-16 04:33:37,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,344 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:33:37,431 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-sp_file-66.i[917,930] [2023-12-16 04:33:37,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:33:37,480 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:33:37,488 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-sp_file-66.i[917,930] [2023-12-16 04:33:37,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:33:37,533 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:33:37,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37 WrapperNode [2023-12-16 04:33:37,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:33:37,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:33:37,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:33:37,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:33:37,539 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:33:37" (1/1) ... [2023-12-16 04:33:37,556 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:33:37" (1/1) ... [2023-12-16 04:33:37,589 INFO L138 Inliner]: procedures = 26, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2023-12-16 04:33:37,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:33:37,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:33:37,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:33:37,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:33:37,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,615 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:33:37,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:33:37,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:33:37,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:33:37,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:33:37,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (1/1) ... [2023-12-16 04:33:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:33:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:33:37,675 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:33:37,692 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:33:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:33:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:33:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:33:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:33:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:33:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:33:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:33:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:33:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:33:37,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:33:37,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:33:37,816 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:33:37,818 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:33:38,166 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:33:38,204 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:33:38,204 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:33:38,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:33:38 BoogieIcfgContainer [2023-12-16 04:33:38,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:33:38,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:33:38,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:33:38,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:33:38,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:33:37" (1/3) ... [2023-12-16 04:33:38,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f98825d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:33:38, skipping insertion in model container [2023-12-16 04:33:38,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:37" (2/3) ... [2023-12-16 04:33:38,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f98825d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:33:38, skipping insertion in model container [2023-12-16 04:33:38,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:33:38" (3/3) ... [2023-12-16 04:33:38,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-66.i [2023-12-16 04:33:38,224 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:33:38,225 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:33:38,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:33:38,268 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;@74d3109e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:33:38,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:33:38,271 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:33:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:33:38,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:38,283 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:33:38,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:38,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1859929948, now seen corresponding path program 1 times [2023-12-16 04:33:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:38,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713222126] [2023-12-16 04:33:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:38,738 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:33:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713222126] [2023-12-16 04:33:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713222126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:33:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71538921] [2023-12-16 04:33:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:38,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:33:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:33:38,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:33:38,770 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:33:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:38,843 INFO L93 Difference]: Finished difference Result 163 states and 259 transitions. [2023-12-16 04:33:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:33:38,845 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:33:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:38,852 INFO L225 Difference]: With dead ends: 163 [2023-12-16 04:33:38,852 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 04:33:38,855 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:33:38,857 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 12 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:38,858 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.0s Time] [2023-12-16 04:33:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 04:33:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-12-16 04:33:38,892 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:33:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2023-12-16 04:33:38,896 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 104 [2023-12-16 04:33:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:38,899 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2023-12-16 04:33:38,899 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:33:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2023-12-16 04:33:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:33:38,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:38,906 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:33:38,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:33:38,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:38,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1802671646, now seen corresponding path program 1 times [2023-12-16 04:33:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669235127] [2023-12-16 04:33:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:39,146 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:33:39,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669235127] [2023-12-16 04:33:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669235127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:33:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40709861] [2023-12-16 04:33:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:39,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:33:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:33:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:33:39,149 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:33:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:39,199 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2023-12-16 04:33:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:33:39,199 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:33:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:39,203 INFO L225 Difference]: With dead ends: 161 [2023-12-16 04:33:39,203 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 04:33:39,205 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:33:39,206 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:33:39,207 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:33:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 04:33:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-12-16 04:33:39,222 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:33:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2023-12-16 04:33:39,224 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 104 [2023-12-16 04:33:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:39,224 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2023-12-16 04:33:39,224 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:33:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2023-12-16 04:33:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:33:39,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:39,228 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:33:39,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:33:39,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:39,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1802612064, now seen corresponding path program 1 times [2023-12-16 04:33:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123555314] [2023-12-16 04:33:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:40,817 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:33:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123555314] [2023-12-16 04:33:40,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123555314] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:40,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:40,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:33:40,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876858137] [2023-12-16 04:33:40,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:40,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:33:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:40,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:33:40,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:33:40,819 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:41,177 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2023-12-16 04:33:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:33:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 104 [2023-12-16 04:33:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:41,181 INFO L225 Difference]: With dead ends: 241 [2023-12-16 04:33:41,182 INFO L226 Difference]: Without dead ends: 161 [2023-12-16 04:33:41,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:33:41,185 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 79 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:41,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 296 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:33:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-16 04:33:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2023-12-16 04:33:41,211 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:33:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2023-12-16 04:33:41,212 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 104 [2023-12-16 04:33:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:41,213 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2023-12-16 04:33:41,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2023-12-16 04:33:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:33:41,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:41,214 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:33:41,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:33:41,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:41,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1416638143, now seen corresponding path program 1 times [2023-12-16 04:33:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427417677] [2023-12-16 04:33:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:41,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:44,549 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:33:44,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427417677] [2023-12-16 04:33:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427417677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:44,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:44,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-16 04:33:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64035429] [2023-12-16 04:33:44,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:44,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 04:33:44,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 04:33:44,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:33:44,551 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:47,145 INFO L93 Difference]: Finished difference Result 504 states and 729 transitions. [2023-12-16 04:33:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:33:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 105 [2023-12-16 04:33:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:47,149 INFO L225 Difference]: With dead ends: 504 [2023-12-16 04:33:47,149 INFO L226 Difference]: Without dead ends: 352 [2023-12-16 04:33:47,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2023-12-16 04:33:47,153 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 474 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:47,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 496 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 04:33:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-16 04:33:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 169. [2023-12-16 04:33:47,172 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:33:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2023-12-16 04:33:47,173 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 105 [2023-12-16 04:33:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:47,173 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2023-12-16 04:33:47,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2023-12-16 04:33:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:33:47,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:47,174 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:33:47,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:33:47,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:47,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1158472705, now seen corresponding path program 1 times [2023-12-16 04:33:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938704719] [2023-12-16 04:33:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:48,292 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:33:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:48,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938704719] [2023-12-16 04:33:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938704719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:33:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835479886] [2023-12-16 04:33:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:33:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:33:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:33:48,294 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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:33:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:49,333 INFO L93 Difference]: Finished difference Result 344 states and 495 transitions. [2023-12-16 04:33:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:33:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 105 [2023-12-16 04:33:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:49,335 INFO L225 Difference]: With dead ends: 344 [2023-12-16 04:33:49,335 INFO L226 Difference]: Without dead ends: 256 [2023-12-16 04:33:49,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:33:49,336 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 439 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:49,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 309 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:33:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-16 04:33:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 183. [2023-12-16 04:33:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.375) internal successors, (209), 152 states have internal predecessors, (209), 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:33:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2023-12-16 04:33:49,373 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 265 transitions. Word has length 105 [2023-12-16 04:33:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:49,373 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 265 transitions. [2023-12-16 04:33:49,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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:33:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 265 transitions. [2023-12-16 04:33:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:33:49,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:49,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] [2023-12-16 04:33:49,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:33:49,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:49,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1857260799, now seen corresponding path program 1 times [2023-12-16 04:33:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:49,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974190240] [2023-12-16 04:33:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:49,795 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:33:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974190240] [2023-12-16 04:33:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974190240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:33:49,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332424975] [2023-12-16 04:33:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:49,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:33:49,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:49,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:33:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:33:49,797 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) 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), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:33:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:50,076 INFO L93 Difference]: Finished difference Result 281 states and 408 transitions. [2023-12-16 04:33:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:33:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) 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), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-12-16 04:33:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:50,078 INFO L225 Difference]: With dead ends: 281 [2023-12-16 04:33:50,078 INFO L226 Difference]: Without dead ends: 179 [2023-12-16 04:33:50,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:33:50,079 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 100 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:50,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 165 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:33:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-16 04:33:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-12-16 04:33:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.3630136986301369) internal successors, (199), 146 states have internal predecessors, (199), 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:33:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions. [2023-12-16 04:33:50,100 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 105 [2023-12-16 04:33:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:50,100 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 255 transitions. [2023-12-16 04:33:50,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) 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), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:33:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2023-12-16 04:33:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 04:33:50,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:50,101 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:33:50,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:33:50,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:50,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1196343626, now seen corresponding path program 1 times [2023-12-16 04:33:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099125676] [2023-12-16 04:33:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:50,368 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:33:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:50,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099125676] [2023-12-16 04:33:50,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099125676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:50,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:50,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:33:50,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093138728] [2023-12-16 04:33:50,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:50,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:33:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:33:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:33:50,370 INFO L87 Difference]: Start difference. First operand 177 states and 255 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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:33:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:50,580 INFO L93 Difference]: Finished difference Result 364 states and 527 transitions. [2023-12-16 04:33:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:33:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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:33:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:50,582 INFO L225 Difference]: With dead ends: 364 [2023-12-16 04:33:50,582 INFO L226 Difference]: Without dead ends: 188 [2023-12-16 04:33:50,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:33:50,583 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:50,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 219 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:33:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-16 04:33:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2023-12-16 04:33:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 154 states have internal predecessors, (208), 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:33:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 264 transitions. [2023-12-16 04:33:50,612 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 264 transitions. Word has length 106 [2023-12-16 04:33:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:50,612 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 264 transitions. [2023-12-16 04:33:50,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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:33:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 264 transitions. [2023-12-16 04:33:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 04:33:50,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:50,614 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:33:50,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:33:50,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:50,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1818759992, now seen corresponding path program 1 times [2023-12-16 04:33:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:50,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682739942] [2023-12-16 04:33:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:51,523 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:33:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682739942] [2023-12-16 04:33:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682739942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:33:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008553398] [2023-12-16 04:33:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:51,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:33:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:51,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:33:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:33:51,525 INFO L87 Difference]: Start difference. First operand 185 states and 264 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:51,834 INFO L93 Difference]: Finished difference Result 377 states and 538 transitions. [2023-12-16 04:33:51,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:33:51,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2023-12-16 04:33:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:51,836 INFO L225 Difference]: With dead ends: 377 [2023-12-16 04:33:51,836 INFO L226 Difference]: Without dead ends: 193 [2023-12-16 04:33:51,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:33:51,837 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 114 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:51,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 378 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:33:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-16 04:33:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2023-12-16 04:33:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 154 states have internal predecessors, (206), 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:33:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2023-12-16 04:33:51,857 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 106 [2023-12-16 04:33:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:51,857 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2023-12-16 04:33:51,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2023-12-16 04:33:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 04:33:51,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:51,859 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:33:51,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:33:51,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:51,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -433550152, now seen corresponding path program 1 times [2023-12-16 04:33:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252416451] [2023-12-16 04:33:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,587 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:33:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252416451] [2023-12-16 04:33:52,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252416451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:52,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:52,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:33:52,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959992985] [2023-12-16 04:33:52,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:52,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:33:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:52,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:33:52,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:33:52,590 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:52,882 INFO L93 Difference]: Finished difference Result 449 states and 635 transitions. [2023-12-16 04:33:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:33:52,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2023-12-16 04:33:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:52,884 INFO L225 Difference]: With dead ends: 449 [2023-12-16 04:33:52,885 INFO L226 Difference]: Without dead ends: 265 [2023-12-16 04:33:52,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:33:52,886 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 135 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:52,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 260 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:33:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-16 04:33:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257. [2023-12-16 04:33:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 211 states have (on average 1.3175355450236967) internal successors, (278), 211 states have internal predecessors, (278), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:33:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 362 transitions. [2023-12-16 04:33:52,919 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 362 transitions. Word has length 106 [2023-12-16 04:33:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:52,919 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 362 transitions. [2023-12-16 04:33:52,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:33:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 362 transitions. [2023-12-16 04:33:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:33:52,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:52,921 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:33:52,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:33:52,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:52,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1071986981, now seen corresponding path program 1 times [2023-12-16 04:33:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:52,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678632997] [2023-12-16 04:33:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:52,971 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:33:52,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678632997] [2023-12-16 04:33:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678632997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:52,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:33:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227793854] [2023-12-16 04:33:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:52,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:33:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:33:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:33:52,973 INFO L87 Difference]: Start difference. First operand 257 states and 362 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:33:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:53,018 INFO L93 Difference]: Finished difference Result 567 states and 798 transitions. [2023-12-16 04:33:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:33:53,019 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:33:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:53,020 INFO L225 Difference]: With dead ends: 567 [2023-12-16 04:33:53,020 INFO L226 Difference]: Without dead ends: 311 [2023-12-16 04:33:53,021 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:33:53,021 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:33:53,022 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:33:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-16 04:33:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 260. [2023-12-16 04:33:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 214 states have (on average 1.3130841121495327) internal successors, (281), 214 states have internal predecessors, (281), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:33:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 365 transitions. [2023-12-16 04:33:53,059 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 365 transitions. Word has length 108 [2023-12-16 04:33:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:53,060 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 365 transitions. [2023-12-16 04:33:53,060 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:33:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 365 transitions. [2023-12-16 04:33:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:33:53,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:53,061 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:33:53,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:33:53,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:53,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash -813821543, now seen corresponding path program 1 times [2023-12-16 04:33:53,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:53,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569369228] [2023-12-16 04:33:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:53,170 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:33:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:53,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569369228] [2023-12-16 04:33:53,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569369228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:53,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:53,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:33:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848792616] [2023-12-16 04:33:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:53,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:33:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:33:53,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:33:53,171 INFO L87 Difference]: Start difference. First operand 260 states and 365 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:33:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:53,222 INFO L93 Difference]: Finished difference Result 564 states and 792 transitions. [2023-12-16 04:33:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:33:53,222 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:33:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:53,225 INFO L225 Difference]: With dead ends: 564 [2023-12-16 04:33:53,225 INFO L226 Difference]: Without dead ends: 305 [2023-12-16 04:33:53,226 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:33:53,226 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:33:53,227 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:33:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-16 04:33:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 269. [2023-12-16 04:33:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 223 states have (on average 1.3004484304932735) internal successors, (290), 223 states have internal predecessors, (290), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:33:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 374 transitions. [2023-12-16 04:33:53,257 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 374 transitions. Word has length 108 [2023-12-16 04:33:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:53,257 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 374 transitions. [2023-12-16 04:33:53,257 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:33:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 374 transitions. [2023-12-16 04:33:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:33:53,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:53,258 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:33:53,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:33:53,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:53,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1493927924, now seen corresponding path program 1 times [2023-12-16 04:33:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104668360] [2023-12-16 04:33:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:54,502 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:33:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104668360] [2023-12-16 04:33:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104668360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:33:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54279011] [2023-12-16 04:33:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:54,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:33:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:33:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:33:54,504 INFO L87 Difference]: Start difference. First operand 269 states and 374 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:33:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:56,161 INFO L93 Difference]: Finished difference Result 607 states and 847 transitions. [2023-12-16 04:33:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:33:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2023-12-16 04:33:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:56,163 INFO L225 Difference]: With dead ends: 607 [2023-12-16 04:33:56,163 INFO L226 Difference]: Without dead ends: 499 [2023-12-16 04:33:56,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2023-12-16 04:33:56,164 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 532 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:56,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 478 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:33:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-12-16 04:33:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 275. [2023-12-16 04:33:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 229 states have (on average 1.3056768558951966) internal successors, (299), 229 states have internal predecessors, (299), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:33:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 383 transitions. [2023-12-16 04:33:56,194 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 383 transitions. Word has length 108 [2023-12-16 04:33:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:56,195 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 383 transitions. [2023-12-16 04:33:56,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:33:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 383 transitions. [2023-12-16 04:33:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:33:56,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:56,196 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:33:56,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:33:56,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:56,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1521805580, now seen corresponding path program 1 times [2023-12-16 04:33:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088888600] [2023-12-16 04:33:56,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:57,318 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:33:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088888600] [2023-12-16 04:33:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088888600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 04:33:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777652547] [2023-12-16 04:33:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:57,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:33:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:33:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:33:57,320 INFO L87 Difference]: Start difference. First operand 275 states and 383 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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:33:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:58,531 INFO L93 Difference]: Finished difference Result 530 states and 740 transitions. [2023-12-16 04:33:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:33:58,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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:33:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:58,533 INFO L225 Difference]: With dead ends: 530 [2023-12-16 04:33:58,533 INFO L226 Difference]: Without dead ends: 416 [2023-12-16 04:33:58,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:33:58,534 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 423 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:58,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 465 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:33:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-12-16 04:33:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 284. [2023-12-16 04:33:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 238 states have internal predecessors, (312), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:33:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2023-12-16 04:33:58,560 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 396 transitions. Word has length 108 [2023-12-16 04:33:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:58,560 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 396 transitions. [2023-12-16 04:33:58,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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:33:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2023-12-16 04:33:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:33:58,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:58,561 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:33:58,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:33:58,562 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:58,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1779971018, now seen corresponding path program 1 times [2023-12-16 04:33:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112100048] [2023-12-16 04:33:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:33:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:33:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:33:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:33:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:33:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:33:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:33:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:33:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:33:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:33:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:33:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:33:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:33:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:33:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:33:59,168 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:33:59,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:33:59,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112100048] [2023-12-16 04:33:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112100048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:33:59,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:33:59,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:33:59,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763862511] [2023-12-16 04:33:59,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:33:59,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:33:59,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:33:59,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:33:59,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:33:59,169 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) 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), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:33:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:33:59,685 INFO L93 Difference]: Finished difference Result 509 states and 713 transitions. [2023-12-16 04:33:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:33:59,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) 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), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2023-12-16 04:33:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:33:59,687 INFO L225 Difference]: With dead ends: 509 [2023-12-16 04:33:59,687 INFO L226 Difference]: Without dead ends: 386 [2023-12-16 04:33:59,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:33:59,688 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 266 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:33:59,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 387 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:33:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-16 04:33:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 284. [2023-12-16 04:33:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 238 states have internal predecessors, (312), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:33:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2023-12-16 04:33:59,717 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 396 transitions. Word has length 108 [2023-12-16 04:33:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:33:59,718 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 396 transitions. [2023-12-16 04:33:59,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) 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), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:33:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2023-12-16 04:33:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:33:59,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:33:59,719 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:33:59,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:33:59,719 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:33:59,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:33:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1983390922, now seen corresponding path program 1 times [2023-12-16 04:33:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:33:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844985681] [2023-12-16 04:33:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:33:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:33:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:00,622 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:34:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844985681] [2023-12-16 04:34:00,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844985681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:00,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:00,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:34:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081674047] [2023-12-16 04:34:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:00,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:34:00,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:00,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:34:00,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:34:00,623 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:34:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:01,526 INFO L93 Difference]: Finished difference Result 548 states and 763 transitions. [2023-12-16 04:34:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:34:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2023-12-16 04:34:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:01,528 INFO L225 Difference]: With dead ends: 548 [2023-12-16 04:34:01,528 INFO L226 Difference]: Without dead ends: 425 [2023-12-16 04:34:01,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:34:01,529 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 649 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:01,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 277 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:34:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-12-16 04:34:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 273. [2023-12-16 04:34:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 227 states have internal predecessors, (295), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 379 transitions. [2023-12-16 04:34:01,558 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 379 transitions. Word has length 108 [2023-12-16 04:34:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:01,558 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 379 transitions. [2023-12-16 04:34:01,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 04:34:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 379 transitions. [2023-12-16 04:34:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:34:01,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:01,559 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:34:01,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:34:01,560 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:01,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash 704157130, now seen corresponding path program 1 times [2023-12-16 04:34:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746936722] [2023-12-16 04:34:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:02,271 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:34:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746936722] [2023-12-16 04:34:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746936722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:02,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:02,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:34:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245768727] [2023-12-16 04:34:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:02,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:34:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:02,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:34:02,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:34:02,275 INFO L87 Difference]: Start difference. First operand 273 states and 379 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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:34:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:02,678 INFO L93 Difference]: Finished difference Result 502 states and 696 transitions. [2023-12-16 04:34:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:34:02,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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:34:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:02,680 INFO L225 Difference]: With dead ends: 502 [2023-12-16 04:34:02,680 INFO L226 Difference]: Without dead ends: 300 [2023-12-16 04:34:02,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:34:02,681 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 312 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:02,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 240 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-16 04:34:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 177. [2023-12-16 04:34:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 146 states have internal predecessors, (189), 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:34:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2023-12-16 04:34:02,700 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 108 [2023-12-16 04:34:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:02,700 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2023-12-16 04:34:02,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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:34:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2023-12-16 04:34:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:34:02,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:02,701 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:34:02,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:34:02,701 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:02,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -123629962, now seen corresponding path program 1 times [2023-12-16 04:34:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450272978] [2023-12-16 04:34:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:03,664 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:34:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450272978] [2023-12-16 04:34:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450272978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:03,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 04:34:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448163129] [2023-12-16 04:34:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:03,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:34:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:03,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:34:03,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:34:03,665 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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:34:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:05,162 INFO L93 Difference]: Finished difference Result 440 states and 607 transitions. [2023-12-16 04:34:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 04:34:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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 110 [2023-12-16 04:34:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:05,163 INFO L225 Difference]: With dead ends: 440 [2023-12-16 04:34:05,163 INFO L226 Difference]: Without dead ends: 340 [2023-12-16 04:34:05,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 04:34:05,164 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 526 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:05,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 553 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 04:34:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-12-16 04:34:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 190. [2023-12-16 04:34:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 159 states have internal predecessors, (208), 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:34:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 264 transitions. [2023-12-16 04:34:05,185 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 264 transitions. Word has length 110 [2023-12-16 04:34:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:05,185 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 264 transitions. [2023-12-16 04:34:05,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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:34:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 264 transitions. [2023-12-16 04:34:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:34:05,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:05,186 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:34:05,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:34:05,187 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:05,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1808250654, now seen corresponding path program 1 times [2023-12-16 04:34:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884964060] [2023-12-16 04:34:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:05,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:06,028 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:34:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884964060] [2023-12-16 04:34:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884964060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:06,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:34:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091155961] [2023-12-16 04:34:06,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:06,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:34:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:34:06,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:34:06,029 INFO L87 Difference]: Start difference. First operand 190 states and 264 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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:34:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:06,450 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2023-12-16 04:34:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:34:06,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 110 [2023-12-16 04:34:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:06,452 INFO L225 Difference]: With dead ends: 371 [2023-12-16 04:34:06,452 INFO L226 Difference]: Without dead ends: 258 [2023-12-16 04:34:06,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:34:06,456 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 378 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:06,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 171 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-16 04:34:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 198. [2023-12-16 04:34:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 167 states have internal predecessors, (218), 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:34:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2023-12-16 04:34:06,482 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 274 transitions. Word has length 110 [2023-12-16 04:34:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:06,482 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 274 transitions. [2023-12-16 04:34:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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:34:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 274 transitions. [2023-12-16 04:34:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:34:06,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:06,483 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:34:06,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:34:06,483 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:06,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash -302828835, now seen corresponding path program 1 times [2023-12-16 04:34:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615656178] [2023-12-16 04:34:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:07,158 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:34:07,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:07,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615656178] [2023-12-16 04:34:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615656178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:34:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887395231] [2023-12-16 04:34:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:07,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:34:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:34:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:34:07,160 INFO L87 Difference]: Start difference. First operand 198 states and 274 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:07,703 INFO L93 Difference]: Finished difference Result 582 states and 803 transitions. [2023-12-16 04:34:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:34:07,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2023-12-16 04:34:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:07,705 INFO L225 Difference]: With dead ends: 582 [2023-12-16 04:34:07,705 INFO L226 Difference]: Without dead ends: 385 [2023-12-16 04:34:07,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:34:07,706 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 369 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:07,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 374 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:34:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-12-16 04:34:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 243. [2023-12-16 04:34:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2023-12-16 04:34:07,739 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 111 [2023-12-16 04:34:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:07,740 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2023-12-16 04:34:07,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2023-12-16 04:34:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:34:07,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:07,741 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:34:07,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 04:34:07,741 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:07,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1987449527, now seen corresponding path program 1 times [2023-12-16 04:34:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:07,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802301577] [2023-12-16 04:34:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:08,573 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:34:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:08,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802301577] [2023-12-16 04:34:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802301577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:34:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957212726] [2023-12-16 04:34:08,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:08,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:34:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:34:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:34:08,575 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:08,931 INFO L93 Difference]: Finished difference Result 451 states and 621 transitions. [2023-12-16 04:34:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:34:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2023-12-16 04:34:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:08,933 INFO L225 Difference]: With dead ends: 451 [2023-12-16 04:34:08,933 INFO L226 Difference]: Without dead ends: 254 [2023-12-16 04:34:08,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:34:08,934 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 235 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:08,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 394 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-16 04:34:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 243. [2023-12-16 04:34:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 197 states have (on average 1.263959390862944) internal successors, (249), 197 states have internal predecessors, (249), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2023-12-16 04:34:08,965 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 111 [2023-12-16 04:34:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:08,965 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2023-12-16 04:34:08,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2023-12-16 04:34:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 04:34:08,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:08,966 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:34:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:34:08,966 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:08,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1313946085, now seen corresponding path program 1 times [2023-12-16 04:34:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740884359] [2023-12-16 04:34:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:09,178 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:34:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:09,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740884359] [2023-12-16 04:34:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740884359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:34:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076846932] [2023-12-16 04:34:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:09,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:34:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:34:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:34:09,179 INFO L87 Difference]: Start difference. First operand 243 states and 333 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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:34:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:09,442 INFO L93 Difference]: Finished difference Result 543 states and 740 transitions. [2023-12-16 04:34:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:34:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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:34:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:09,444 INFO L225 Difference]: With dead ends: 543 [2023-12-16 04:34:09,444 INFO L226 Difference]: Without dead ends: 344 [2023-12-16 04:34:09,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:34:09,445 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 163 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:09,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 329 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:34:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-12-16 04:34:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 266. [2023-12-16 04:34:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 220 states have (on average 1.25) internal successors, (275), 220 states have internal predecessors, (275), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2023-12-16 04:34:09,479 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 111 [2023-12-16 04:34:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:09,479 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2023-12-16 04:34:09,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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:34:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2023-12-16 04:34:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:34:09,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:09,480 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:34:09,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:34:09,480 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:09,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 40895103, now seen corresponding path program 1 times [2023-12-16 04:34:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396567179] [2023-12-16 04:34:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:11,014 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:34:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396567179] [2023-12-16 04:34:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396567179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:11,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:11,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-16 04:34:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599260144] [2023-12-16 04:34:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:11,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 04:34:11,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:11,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 04:34:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:34:11,015 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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:34:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:13,680 INFO L93 Difference]: Finished difference Result 348 states and 462 transitions. [2023-12-16 04:34:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:34:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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 112 [2023-12-16 04:34:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:13,683 INFO L225 Difference]: With dead ends: 348 [2023-12-16 04:34:13,683 INFO L226 Difference]: Without dead ends: 346 [2023-12-16 04:34:13,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2023-12-16 04:34:13,683 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 561 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:13,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 480 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 04:34:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-12-16 04:34:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 289. [2023-12-16 04:34:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 243 states have (on average 1.2633744855967077) internal successors, (307), 243 states have internal predecessors, (307), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 391 transitions. [2023-12-16 04:34:13,718 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 391 transitions. Word has length 112 [2023-12-16 04:34:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:13,719 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 391 transitions. [2023-12-16 04:34:13,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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:34:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 391 transitions. [2023-12-16 04:34:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:34:13,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:13,720 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:34:13,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:34:13,720 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:13,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 40954685, now seen corresponding path program 1 times [2023-12-16 04:34:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045671907] [2023-12-16 04:34:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:15,869 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:34:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045671907] [2023-12-16 04:34:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045671907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-16 04:34:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622798894] [2023-12-16 04:34:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:15,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 04:34:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 04:34:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:34:15,870 INFO L87 Difference]: Start difference. First operand 289 states and 391 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:17,661 INFO L93 Difference]: Finished difference Result 661 states and 897 transitions. [2023-12-16 04:34:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:34:17,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2023-12-16 04:34:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:17,663 INFO L225 Difference]: With dead ends: 661 [2023-12-16 04:34:17,663 INFO L226 Difference]: Without dead ends: 494 [2023-12-16 04:34:17,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2023-12-16 04:34:17,664 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 599 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:17,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 501 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:34:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-12-16 04:34:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 382. [2023-12-16 04:34:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 336 states have (on average 1.3005952380952381) internal successors, (437), 336 states have internal predecessors, (437), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 521 transitions. [2023-12-16 04:34:17,713 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 521 transitions. Word has length 112 [2023-12-16 04:34:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:17,713 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 521 transitions. [2023-12-16 04:34:17,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 521 transitions. [2023-12-16 04:34:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:34:17,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:17,715 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:34:17,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 04:34:17,715 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:17,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 98212987, now seen corresponding path program 1 times [2023-12-16 04:34:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:17,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138122958] [2023-12-16 04:34:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:17,993 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:34:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138122958] [2023-12-16 04:34:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138122958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:34:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244275035] [2023-12-16 04:34:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:17,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:34:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:34:17,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:34:17,994 INFO L87 Difference]: Start difference. First operand 382 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:34:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:18,254 INFO L93 Difference]: Finished difference Result 698 states and 946 transitions. [2023-12-16 04:34:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:34:18,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 112 [2023-12-16 04:34:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:18,257 INFO L225 Difference]: With dead ends: 698 [2023-12-16 04:34:18,257 INFO L226 Difference]: Without dead ends: 531 [2023-12-16 04:34:18,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:34:18,258 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 172 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:18,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 366 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:34:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-12-16 04:34:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 477. [2023-12-16 04:34:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 431 states have (on average 1.2993039443155452) internal successors, (560), 431 states have internal predecessors, (560), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 644 transitions. [2023-12-16 04:34:18,296 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 644 transitions. Word has length 112 [2023-12-16 04:34:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:18,297 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 644 transitions. [2023-12-16 04:34:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:34:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 644 transitions. [2023-12-16 04:34:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:34:18,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:18,298 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:34:18,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 04:34:18,298 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:18,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash -980113669, now seen corresponding path program 1 times [2023-12-16 04:34:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:18,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113615404] [2023-12-16 04:34:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:18,823 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:34:18,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113615404] [2023-12-16 04:34:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113615404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:18,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:18,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:34:18,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984606825] [2023-12-16 04:34:18,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:18,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:34:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:34:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:34:18,825 INFO L87 Difference]: Start difference. First operand 477 states and 644 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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:34:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:19,322 INFO L93 Difference]: Finished difference Result 769 states and 1032 transitions. [2023-12-16 04:34:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:34:19,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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 112 [2023-12-16 04:34:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:19,324 INFO L225 Difference]: With dead ends: 769 [2023-12-16 04:34:19,324 INFO L226 Difference]: Without dead ends: 553 [2023-12-16 04:34:19,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:34:19,325 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 261 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:19,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 320 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:34:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2023-12-16 04:34:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 471. [2023-12-16 04:34:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 425 states have (on average 1.296470588235294) internal successors, (551), 425 states have internal predecessors, (551), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 635 transitions. [2023-12-16 04:34:19,366 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 635 transitions. Word has length 112 [2023-12-16 04:34:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:19,366 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 635 transitions. [2023-12-16 04:34:19,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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:34:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 635 transitions. [2023-12-16 04:34:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:34:19,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:19,367 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:34:19,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 04:34:19,367 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:19,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1664230099, now seen corresponding path program 1 times [2023-12-16 04:34:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794210639] [2023-12-16 04:34:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:19,554 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:34:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794210639] [2023-12-16 04:34:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794210639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:19,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:34:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975446141] [2023-12-16 04:34:19,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:19,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:34:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:34:19,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:34:19,556 INFO L87 Difference]: Start difference. First operand 471 states and 635 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:34:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:19,840 INFO L93 Difference]: Finished difference Result 823 states and 1103 transitions. [2023-12-16 04:34:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:34:19,840 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:34:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:19,842 INFO L225 Difference]: With dead ends: 823 [2023-12-16 04:34:19,842 INFO L226 Difference]: Without dead ends: 545 [2023-12-16 04:34:19,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:34:19,843 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 148 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:19,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 344 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:34:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-16 04:34:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 443. [2023-12-16 04:34:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 397 states have (on average 1.2720403022670026) internal successors, (505), 397 states have internal predecessors, (505), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 589 transitions. [2023-12-16 04:34:19,887 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 589 transitions. Word has length 113 [2023-12-16 04:34:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:19,887 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 589 transitions. [2023-12-16 04:34:19,887 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:34:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 589 transitions. [2023-12-16 04:34:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:34:19,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:19,888 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:34:19,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 04:34:19,888 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:19,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2034807433, now seen corresponding path program 1 times [2023-12-16 04:34:19,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:19,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312422518] [2023-12-16 04:34:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:19,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:20,687 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:34:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312422518] [2023-12-16 04:34:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312422518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:20,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 04:34:20,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20096098] [2023-12-16 04:34:20,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:20,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:34:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:34:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:34:20,688 INFO L87 Difference]: Start difference. First operand 443 states and 589 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:21,307 INFO L93 Difference]: Finished difference Result 733 states and 975 transitions. [2023-12-16 04:34:21,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:34:21,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2023-12-16 04:34:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:21,309 INFO L225 Difference]: With dead ends: 733 [2023-12-16 04:34:21,309 INFO L226 Difference]: Without dead ends: 483 [2023-12-16 04:34:21,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:34:21,310 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 398 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:21,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 359 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:34:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-16 04:34:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 409. [2023-12-16 04:34:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 363 states have (on average 1.256198347107438) internal successors, (456), 363 states have internal predecessors, (456), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 540 transitions. [2023-12-16 04:34:21,347 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 540 transitions. Word has length 113 [2023-12-16 04:34:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:21,347 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 540 transitions. [2023-12-16 04:34:21,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 540 transitions. [2023-12-16 04:34:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:34:21,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:21,348 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:34:21,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 04:34:21,348 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:21,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1023690183, now seen corresponding path program 1 times [2023-12-16 04:34:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85357933] [2023-12-16 04:34:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:22,309 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:34:22,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85357933] [2023-12-16 04:34:22,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85357933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:22,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:22,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 04:34:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013517126] [2023-12-16 04:34:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:22,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 04:34:22,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 04:34:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:34:22,311 INFO L87 Difference]: Start difference. First operand 409 states and 540 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:22,900 INFO L93 Difference]: Finished difference Result 699 states and 926 transitions. [2023-12-16 04:34:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:34:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2023-12-16 04:34:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:22,906 INFO L225 Difference]: With dead ends: 699 [2023-12-16 04:34:22,906 INFO L226 Difference]: Without dead ends: 483 [2023-12-16 04:34:22,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2023-12-16 04:34:22,908 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 463 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:22,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 491 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:34:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-16 04:34:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 413. [2023-12-16 04:34:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 367 states have (on average 1.2534059945504088) internal successors, (460), 367 states have internal predecessors, (460), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 544 transitions. [2023-12-16 04:34:22,952 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 544 transitions. Word has length 113 [2023-12-16 04:34:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:22,952 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 544 transitions. [2023-12-16 04:34:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 04:34:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 544 transitions. [2023-12-16 04:34:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:22,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:22,953 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:34:22,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 04:34:22,953 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:22,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -498748317, now seen corresponding path program 1 times [2023-12-16 04:34:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:22,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662375515] [2023-12-16 04:34:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,354 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:34:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:23,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662375515] [2023-12-16 04:34:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662375515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:34:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042207664] [2023-12-16 04:34:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:23,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:34:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:23,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:34:23,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:34:23,356 INFO L87 Difference]: Start difference. First operand 413 states and 544 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:34:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:23,675 INFO L93 Difference]: Finished difference Result 686 states and 906 transitions. [2023-12-16 04:34:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:34:23,675 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:34:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:23,676 INFO L225 Difference]: With dead ends: 686 [2023-12-16 04:34:23,676 INFO L226 Difference]: Without dead ends: 465 [2023-12-16 04:34:23,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:34:23,677 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 187 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:23,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 292 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:34:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-12-16 04:34:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 413. [2023-12-16 04:34:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 367 states have (on average 1.2452316076294279) internal successors, (457), 367 states have internal predecessors, (457), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 541 transitions. [2023-12-16 04:34:23,714 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 541 transitions. Word has length 114 [2023-12-16 04:34:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:23,714 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 541 transitions. [2023-12-16 04:34:23,714 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:34:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 541 transitions. [2023-12-16 04:34:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:23,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:23,715 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:34:23,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 04:34:23,715 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:23,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -917729299, now seen corresponding path program 1 times [2023-12-16 04:34:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048142770] [2023-12-16 04:34:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,755 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:34:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048142770] [2023-12-16 04:34:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048142770] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:23,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:34:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245701243] [2023-12-16 04:34:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:23,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:34:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:23,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:34:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:34:23,756 INFO L87 Difference]: Start difference. First operand 413 states and 541 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:34:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:23,805 INFO L93 Difference]: Finished difference Result 746 states and 985 transitions. [2023-12-16 04:34:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:34:23,805 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:34:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:23,806 INFO L225 Difference]: With dead ends: 746 [2023-12-16 04:34:23,806 INFO L226 Difference]: Without dead ends: 448 [2023-12-16 04:34:23,807 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:34:23,807 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:34:23,808 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:34:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-16 04:34:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 417. [2023-12-16 04:34:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.2425876010781671) internal successors, (461), 371 states have internal predecessors, (461), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 545 transitions. [2023-12-16 04:34:23,847 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 545 transitions. Word has length 114 [2023-12-16 04:34:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:23,848 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 545 transitions. [2023-12-16 04:34:23,848 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:34:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 545 transitions. [2023-12-16 04:34:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:23,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:23,849 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:34:23,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 04:34:23,849 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:23,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash -524702289, now seen corresponding path program 1 times [2023-12-16 04:34:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338895504] [2023-12-16 04:34:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:23,994 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:34:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338895504] [2023-12-16 04:34:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338895504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:34:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917250746] [2023-12-16 04:34:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:23,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:34:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:34:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:34:23,996 INFO L87 Difference]: Start difference. First operand 417 states and 545 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:34:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:24,142 INFO L93 Difference]: Finished difference Result 797 states and 1045 transitions. [2023-12-16 04:34:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:34:24,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:34:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:24,154 INFO L225 Difference]: With dead ends: 797 [2023-12-16 04:34:24,154 INFO L226 Difference]: Without dead ends: 502 [2023-12-16 04:34:24,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:34:24,155 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 73 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:24,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 288 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:34:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-16 04:34:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 422. [2023-12-16 04:34:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 376 states have (on average 1.2420212765957446) internal successors, (467), 376 states have internal predecessors, (467), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 551 transitions. [2023-12-16 04:34:24,199 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 551 transitions. Word has length 114 [2023-12-16 04:34:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:24,199 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 551 transitions. [2023-12-16 04:34:24,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:34:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 551 transitions. [2023-12-16 04:34:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:24,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:24,200 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:34:24,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 04:34:24,200 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:24,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash -216664721, now seen corresponding path program 1 times [2023-12-16 04:34:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750683290] [2023-12-16 04:34:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:24,639 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:34:24,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:24,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750683290] [2023-12-16 04:34:24,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750683290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:24,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:24,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:34:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446656616] [2023-12-16 04:34:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:24,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:34:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:24,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:34:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:34:24,641 INFO L87 Difference]: Start difference. First operand 422 states and 551 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 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:34:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:25,144 INFO L93 Difference]: Finished difference Result 828 states and 1082 transitions. [2023-12-16 04:34:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:34:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 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:34:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:25,146 INFO L225 Difference]: With dead ends: 828 [2023-12-16 04:34:25,146 INFO L226 Difference]: Without dead ends: 528 [2023-12-16 04:34:25,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:34:25,147 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 276 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:25,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 422 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-16 04:34:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 428. [2023-12-16 04:34:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 382 states have (on average 1.2382198952879582) internal successors, (473), 382 states have internal predecessors, (473), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 557 transitions. [2023-12-16 04:34:25,190 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 557 transitions. Word has length 114 [2023-12-16 04:34:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:25,190 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 557 transitions. [2023-12-16 04:34:25,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 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:34:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 557 transitions. [2023-12-16 04:34:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:25,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:25,191 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:34:25,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 04:34:25,191 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:25,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash 176362289, now seen corresponding path program 1 times [2023-12-16 04:34:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:25,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213894262] [2023-12-16 04:34:25,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:34:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:34:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:34:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:34:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:34:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:34:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:34:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:34:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:34:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:34:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:25,952 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:34:25,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:34:25,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213894262] [2023-12-16 04:34:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213894262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:34:25,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:34:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:34:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917826630] [2023-12-16 04:34:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:34:25,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:34:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:34:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:34:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:34:25,953 INFO L87 Difference]: Start difference. First operand 428 states and 557 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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:34:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:34:26,456 INFO L93 Difference]: Finished difference Result 480 states and 625 transitions. [2023-12-16 04:34:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:34:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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:34:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:34:26,458 INFO L225 Difference]: With dead ends: 480 [2023-12-16 04:34:26,458 INFO L226 Difference]: Without dead ends: 478 [2023-12-16 04:34:26,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:34:26,459 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 165 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:34:26,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 300 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:34:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-16 04:34:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 434. [2023-12-16 04:34:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 388 states have (on average 1.2396907216494846) internal successors, (481), 388 states have internal predecessors, (481), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:34:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 565 transitions. [2023-12-16 04:34:26,496 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 565 transitions. Word has length 114 [2023-12-16 04:34:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:34:26,496 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 565 transitions. [2023-12-16 04:34:26,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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:34:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 565 transitions. [2023-12-16 04:34:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:34:26,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:34:26,497 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:34:26,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 04:34:26,497 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:34:26,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:34:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 176421871, now seen corresponding path program 1 times [2023-12-16 04:34:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:34:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331795604] [2023-12-16 04:34:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:34:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:34:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:34:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:34:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:34:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:34:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:34:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 04:34:27,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 04:34:27,625 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 04:34:27,633 INFO L158 Benchmark]: Toolchain (without parser) took 50329.04ms. Allocated memory was 292.6MB in the beginning and 760.2MB in the end (delta: 467.7MB). Free memory was 238.8MB in the beginning and 654.4MB in the end (delta: -415.6MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. [2023-12-16 04:34:27,633 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 234.9MB. Free memory is still 184.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:34:27,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.60ms. Allocated memory is still 292.6MB. Free memory was 238.5MB in the beginning and 223.0MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:34:27,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.62ms. Allocated memory is still 292.6MB. Free memory was 223.0MB in the beginning and 218.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:34:27,634 INFO L158 Benchmark]: Boogie Preprocessor took 58.21ms. Allocated memory is still 292.6MB. Free memory was 218.6MB in the beginning and 213.6MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:34:27,634 INFO L158 Benchmark]: RCFGBuilder took 556.19ms. Allocated memory is still 292.6MB. Free memory was 213.6MB in the beginning and 232.3MB in the end (delta: -18.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:34:27,634 INFO L158 Benchmark]: TraceAbstraction took 49426.84ms. Allocated memory was 292.6MB in the beginning and 760.2MB in the end (delta: 467.7MB). Free memory was 231.8MB in the beginning and 654.4MB in the end (delta: -422.7MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. [2023-12-16 04:34:27,635 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 234.9MB. Free memory is still 184.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.60ms. Allocated memory is still 292.6MB. Free memory was 238.5MB in the beginning and 223.0MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.62ms. Allocated memory is still 292.6MB. Free memory was 223.0MB in the beginning and 218.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.21ms. Allocated memory is still 292.6MB. Free memory was 218.6MB in the beginning and 213.6MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 556.19ms. Allocated memory is still 292.6MB. Free memory was 213.6MB in the beginning and 232.3MB in the end (delta: -18.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 49426.84ms. Allocated memory was 292.6MB in the beginning and 760.2MB in the end (delta: 467.7MB). Free memory was 231.8MB in the beginning and 654.4MB in the end (delta: -422.7MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown