./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:47:15,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:47:15,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:47:15,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:47:15,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:47:15,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:47:15,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:47:15,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:47:15,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:47:15,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:47:15,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:47:15,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:47:15,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:47:15,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:47:15,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:47:15,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:47:15,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:47:15,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:47:15,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:47:15,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:47:15,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:47:15,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:47:15,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:47:15,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:47:15,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:47:15,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:47:15,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:47:15,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:47:15,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:47:15,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:47:15,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:47:15,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:47:15,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:47:15,249 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709 [2024-10-11 06:47:15,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:47:15,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:47:15,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:47:15,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:47:15,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:47:15,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2024-10-11 06:47:16,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:47:16,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:47:16,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2024-10-11 06:47:16,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0cf540025/5614f83227124f49a3d6fd82e208aedd/FLAG9ebd32e0e [2024-10-11 06:47:16,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0cf540025/5614f83227124f49a3d6fd82e208aedd [2024-10-11 06:47:16,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:47:16,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:47:16,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:47:16,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:47:16,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:47:16,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:47:16" (1/1) ... [2024-10-11 06:47:16,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3431bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:16, skipping insertion in model container [2024-10-11 06:47:16,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:47:16" (1/1) ... [2024-10-11 06:47:17,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:47:17,151 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2024-10-11 06:47:17,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:47:17,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:47:17,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2024-10-11 06:47:17,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:47:17,437 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:47:17,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17 WrapperNode [2024-10-11 06:47:17,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:47:17,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:47:17,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:47:17,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:47:17,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,665 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1980 [2024-10-11 06:47:17,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:47:17,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:47:17,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:47:17,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:47:17,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,832 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 06:47:17,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:47:17,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:47:17,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:47:17,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:47:17,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (1/1) ... [2024-10-11 06:47:17,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:47:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:47:18,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:47:18,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:47:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:47:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 06:47:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 06:47:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:47:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:47:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:47:18,257 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:47:18,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:47:20,083 INFO L? ?]: Removed 1004 outVars from TransFormulas that were not future-live. [2024-10-11 06:47:20,083 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:47:20,129 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:47:20,129 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:47:20,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:47:20 BoogieIcfgContainer [2024-10-11 06:47:20,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:47:20,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:47:20,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:47:20,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:47:20,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:47:16" (1/3) ... [2024-10-11 06:47:20,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca38add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:47:20, skipping insertion in model container [2024-10-11 06:47:20,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:47:17" (2/3) ... [2024-10-11 06:47:20,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca38add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:47:20, skipping insertion in model container [2024-10-11 06:47:20,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:47:20" (3/3) ... [2024-10-11 06:47:20,136 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2024-10-11 06:47:20,148 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:47:20,148 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:47:20,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:47:20,227 INFO L333 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, 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;@3ebc2b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:47:20,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:47:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 669 states, 664 states have (on average 1.5060240963855422) internal successors, (1000), 665 states have internal predecessors, (1000), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 06:47:20,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:20,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:20,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1139893507, now seen corresponding path program 1 times [2024-10-11 06:47:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343796181] [2024-10-11 06:47:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 06:47:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343796181] [2024-10-11 06:47:20,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343796181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:20,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 06:47:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887320464] [2024-10-11 06:47:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 06:47:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 06:47:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 06:47:20,683 INFO L87 Difference]: Start difference. First operand has 669 states, 664 states have (on average 1.5060240963855422) internal successors, (1000), 665 states have internal predecessors, (1000), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:20,743 INFO L93 Difference]: Finished difference Result 1304 states and 1961 transitions. [2024-10-11 06:47:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 06:47:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 224 [2024-10-11 06:47:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:20,762 INFO L225 Difference]: With dead ends: 1304 [2024-10-11 06:47:20,762 INFO L226 Difference]: Without dead ends: 668 [2024-10-11 06:47:20,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 06:47:20,773 INFO L432 NwaCegarLoop]: 992 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:20,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 992 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-10-11 06:47:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2024-10-11 06:47:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 664 states have (on average 1.4894578313253013) internal successors, (989), 664 states have internal predecessors, (989), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 993 transitions. [2024-10-11 06:47:20,828 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 993 transitions. Word has length 224 [2024-10-11 06:47:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:20,829 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 993 transitions. [2024-10-11 06:47:20,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 993 transitions. [2024-10-11 06:47:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 06:47:20,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:20,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:20,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:47:20,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:20,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash -188362503, now seen corresponding path program 1 times [2024-10-11 06:47:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050220392] [2024-10-11 06:47:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:21,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 06:47:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050220392] [2024-10-11 06:47:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050220392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:21,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:21,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323160480] [2024-10-11 06:47:21,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:21,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:21,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:21,830 INFO L87 Difference]: Start difference. First operand 668 states and 993 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:21,876 INFO L93 Difference]: Finished difference Result 672 states and 997 transitions. [2024-10-11 06:47:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:21,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 224 [2024-10-11 06:47:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:21,881 INFO L225 Difference]: With dead ends: 672 [2024-10-11 06:47:21,882 INFO L226 Difference]: Without dead ends: 670 [2024-10-11 06:47:21,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:21,886 INFO L432 NwaCegarLoop]: 990 mSDtfsCounter, 0 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:21,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2965 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-11 06:47:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2024-10-11 06:47:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 666 states have (on average 1.487987987987988) internal successors, (991), 666 states have internal predecessors, (991), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 995 transitions. [2024-10-11 06:47:21,913 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 995 transitions. Word has length 224 [2024-10-11 06:47:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:21,916 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 995 transitions. [2024-10-11 06:47:21,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 995 transitions. [2024-10-11 06:47:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 06:47:21,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:21,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:21,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:47:21,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:21,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1542573778, now seen corresponding path program 1 times [2024-10-11 06:47:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:21,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126119383] [2024-10-11 06:47:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 06:47:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126119383] [2024-10-11 06:47:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126119383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:47:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085445935] [2024-10-11 06:47:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:47:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:47:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:22,469 INFO L87 Difference]: Start difference. First operand 670 states and 995 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:22,677 INFO L93 Difference]: Finished difference Result 1914 states and 2847 transitions. [2024-10-11 06:47:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 225 [2024-10-11 06:47:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:22,681 INFO L225 Difference]: With dead ends: 1914 [2024-10-11 06:47:22,682 INFO L226 Difference]: Without dead ends: 670 [2024-10-11 06:47:22,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:22,685 INFO L432 NwaCegarLoop]: 986 mSDtfsCounter, 2546 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2547 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:22,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2547 Valid, 2894 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-11 06:47:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2024-10-11 06:47:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 666 states have (on average 1.4864864864864864) internal successors, (990), 666 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 994 transitions. [2024-10-11 06:47:22,699 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 994 transitions. Word has length 225 [2024-10-11 06:47:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:22,700 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 994 transitions. [2024-10-11 06:47:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 994 transitions. [2024-10-11 06:47:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 06:47:22,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:22,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:22,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:47:22,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:22,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 579297248, now seen corresponding path program 1 times [2024-10-11 06:47:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981668834] [2024-10-11 06:47:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:23,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:23,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981668834] [2024-10-11 06:47:23,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981668834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:23,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675635700] [2024-10-11 06:47:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:23,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:23,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:23,149 INFO L87 Difference]: Start difference. First operand 670 states and 994 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:23,180 INFO L93 Difference]: Finished difference Result 1309 states and 1942 transitions. [2024-10-11 06:47:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:23,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226 [2024-10-11 06:47:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:23,183 INFO L225 Difference]: With dead ends: 1309 [2024-10-11 06:47:23,183 INFO L226 Difference]: Without dead ends: 672 [2024-10-11 06:47:23,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:23,186 INFO L432 NwaCegarLoop]: 989 mSDtfsCounter, 0 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:23,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2959 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-11 06:47:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-11 06:47:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 668 states have (on average 1.4850299401197604) internal successors, (992), 668 states have internal predecessors, (992), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 996 transitions. [2024-10-11 06:47:23,200 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 996 transitions. Word has length 226 [2024-10-11 06:47:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:23,201 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 996 transitions. [2024-10-11 06:47:23,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 996 transitions. [2024-10-11 06:47:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-11 06:47:23,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:23,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:47:23,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash -319619072, now seen corresponding path program 1 times [2024-10-11 06:47:23,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:23,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039327542] [2024-10-11 06:47:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:23,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:23,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039327542] [2024-10-11 06:47:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039327542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:23,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495274146] [2024-10-11 06:47:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:23,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:23,673 INFO L87 Difference]: Start difference. First operand 672 states and 996 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:23,765 INFO L93 Difference]: Finished difference Result 1311 states and 1943 transitions. [2024-10-11 06:47:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2024-10-11 06:47:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:23,768 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 06:47:23,768 INFO L226 Difference]: Without dead ends: 672 [2024-10-11 06:47:23,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:23,770 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 950 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:23,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1952 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-11 06:47:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-11 06:47:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 668 states have (on average 1.4835329341317365) internal successors, (991), 668 states have internal predecessors, (991), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 995 transitions. [2024-10-11 06:47:23,784 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 995 transitions. Word has length 227 [2024-10-11 06:47:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:23,785 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 995 transitions. [2024-10-11 06:47:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 995 transitions. [2024-10-11 06:47:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 06:47:23,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:23,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:23,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:47:23,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1949099169, now seen corresponding path program 1 times [2024-10-11 06:47:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331145744] [2024-10-11 06:47:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:24,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331145744] [2024-10-11 06:47:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331145744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123800774] [2024-10-11 06:47:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:24,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:24,175 INFO L87 Difference]: Start difference. First operand 672 states and 995 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:24,229 INFO L93 Difference]: Finished difference Result 1311 states and 1941 transitions. [2024-10-11 06:47:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:24,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 06:47:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:24,232 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 06:47:24,232 INFO L226 Difference]: Without dead ends: 672 [2024-10-11 06:47:24,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:24,234 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 948 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:24,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1952 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:24,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-11 06:47:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-11 06:47:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 668 states have (on average 1.4820359281437125) internal successors, (990), 668 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 994 transitions. [2024-10-11 06:47:24,244 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 994 transitions. Word has length 228 [2024-10-11 06:47:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:24,244 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 994 transitions. [2024-10-11 06:47:24,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 994 transitions. [2024-10-11 06:47:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 06:47:24,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:24,247 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:24,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:47:24,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -214865155, now seen corresponding path program 1 times [2024-10-11 06:47:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:24,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115752408] [2024-10-11 06:47:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:24,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115752408] [2024-10-11 06:47:24,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115752408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:24,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:47:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995857997] [2024-10-11 06:47:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:24,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:47:24,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:47:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:24,873 INFO L87 Difference]: Start difference. First operand 672 states and 994 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:24,962 INFO L93 Difference]: Finished difference Result 1830 states and 2709 transitions. [2024-10-11 06:47:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:47:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 229 [2024-10-11 06:47:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:24,966 INFO L225 Difference]: With dead ends: 1830 [2024-10-11 06:47:24,966 INFO L226 Difference]: Without dead ends: 1191 [2024-10-11 06:47:24,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:24,967 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 741 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:24,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3892 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-11 06:47:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 711. [2024-10-11 06:47:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 705 states have (on average 1.476595744680851) internal successors, (1041), 705 states have internal predecessors, (1041), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 06:47:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1049 transitions. [2024-10-11 06:47:24,980 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1049 transitions. Word has length 229 [2024-10-11 06:47:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:24,980 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1049 transitions. [2024-10-11 06:47:24,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1049 transitions. [2024-10-11 06:47:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 06:47:24,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:24,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:47:24,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1938623429, now seen corresponding path program 1 times [2024-10-11 06:47:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363047459] [2024-10-11 06:47:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:25,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363047459] [2024-10-11 06:47:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363047459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:25,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467881334] [2024-10-11 06:47:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:25,254 INFO L87 Difference]: Start difference. First operand 711 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:25,298 INFO L93 Difference]: Finished difference Result 1389 states and 2049 transitions. [2024-10-11 06:47:25,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:25,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 230 [2024-10-11 06:47:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:25,301 INFO L225 Difference]: With dead ends: 1389 [2024-10-11 06:47:25,301 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 06:47:25,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:25,302 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 943 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:25,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1966 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 06:47:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-10-11 06:47:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 705 states have (on average 1.475177304964539) internal successors, (1040), 705 states have internal predecessors, (1040), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 06:47:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1048 transitions. [2024-10-11 06:47:25,320 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1048 transitions. Word has length 230 [2024-10-11 06:47:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:25,321 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1048 transitions. [2024-10-11 06:47:25,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1048 transitions. [2024-10-11 06:47:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 06:47:25,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:25,323 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:25,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:47:25,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1053049807, now seen corresponding path program 1 times [2024-10-11 06:47:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667017916] [2024-10-11 06:47:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:47:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:47:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:25,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:25,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667017916] [2024-10-11 06:47:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667017916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:25,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440259718] [2024-10-11 06:47:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:25,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:25,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:25,766 INFO L87 Difference]: Start difference. First operand 711 states and 1048 transitions. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:25,876 INFO L93 Difference]: Finished difference Result 1908 states and 2816 transitions. [2024-10-11 06:47:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:25,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 230 [2024-10-11 06:47:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:25,880 INFO L225 Difference]: With dead ends: 1908 [2024-10-11 06:47:25,880 INFO L226 Difference]: Without dead ends: 1230 [2024-10-11 06:47:25,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:25,882 INFO L432 NwaCegarLoop]: 1733 mSDtfsCounter, 1144 mSDsluCounter, 4428 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 6161 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:25,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 6161 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-10-11 06:47:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1086. [2024-10-11 06:47:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1078 states have (on average 1.4786641929499071) internal successors, (1594), 1078 states have internal predecessors, (1594), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 06:47:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1606 transitions. [2024-10-11 06:47:25,900 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1606 transitions. Word has length 230 [2024-10-11 06:47:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:25,900 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1606 transitions. [2024-10-11 06:47:25,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1606 transitions. [2024-10-11 06:47:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 06:47:25,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:25,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:25,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 06:47:25,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:25,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1805432090, now seen corresponding path program 1 times [2024-10-11 06:47:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337130175] [2024-10-11 06:47:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337130175] [2024-10-11 06:47:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337130175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:26,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:26,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:26,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710582288] [2024-10-11 06:47:26,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:26,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:26,439 INFO L87 Difference]: Start difference. First operand 1086 states and 1606 transitions. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:26,553 INFO L93 Difference]: Finished difference Result 2619 states and 3876 transitions. [2024-10-11 06:47:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:26,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-10-11 06:47:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:26,559 INFO L225 Difference]: With dead ends: 2619 [2024-10-11 06:47:26,559 INFO L226 Difference]: Without dead ends: 1566 [2024-10-11 06:47:26,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:26,561 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 854 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 4841 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:26,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 4841 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-11 06:47:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1134. [2024-10-11 06:47:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1126 states have (on average 1.477797513321492) internal successors, (1664), 1126 states have internal predecessors, (1664), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 06:47:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1676 transitions. [2024-10-11 06:47:26,583 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1676 transitions. Word has length 231 [2024-10-11 06:47:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1676 transitions. [2024-10-11 06:47:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1676 transitions. [2024-10-11 06:47:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 06:47:26,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:26,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:26,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:47:26,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:26,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 176261341, now seen corresponding path program 1 times [2024-10-11 06:47:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698720640] [2024-10-11 06:47:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:47:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:47:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698720640] [2024-10-11 06:47:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698720640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:27,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:27,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655008952] [2024-10-11 06:47:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:27,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:27,096 INFO L87 Difference]: Start difference. First operand 1134 states and 1676 transitions. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:27,200 INFO L93 Difference]: Finished difference Result 2819 states and 4165 transitions. [2024-10-11 06:47:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:27,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-10-11 06:47:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:27,206 INFO L225 Difference]: With dead ends: 2819 [2024-10-11 06:47:27,206 INFO L226 Difference]: Without dead ends: 1718 [2024-10-11 06:47:27,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:27,208 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 354 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:27,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 4859 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2024-10-11 06:47:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1544. [2024-10-11 06:47:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1530 states have (on average 1.4718954248366014) internal successors, (2252), 1530 states have internal predecessors, (2252), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 06:47:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2276 transitions. [2024-10-11 06:47:27,233 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2276 transitions. Word has length 231 [2024-10-11 06:47:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2276 transitions. [2024-10-11 06:47:27,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2276 transitions. [2024-10-11 06:47:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 06:47:27,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:27,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:27,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:47:27,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2003537440, now seen corresponding path program 1 times [2024-10-11 06:47:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435816242] [2024-10-11 06:47:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:47:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:47:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435816242] [2024-10-11 06:47:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435816242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584361394] [2024-10-11 06:47:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:27,755 INFO L87 Difference]: Start difference. First operand 1544 states and 2276 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:27,888 INFO L93 Difference]: Finished difference Result 2855 states and 4211 transitions. [2024-10-11 06:47:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:27,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-10-11 06:47:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:27,893 INFO L225 Difference]: With dead ends: 2855 [2024-10-11 06:47:27,894 INFO L226 Difference]: Without dead ends: 1688 [2024-10-11 06:47:27,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:27,896 INFO L432 NwaCegarLoop]: 1734 mSDtfsCounter, 720 mSDsluCounter, 5405 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 7139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:27,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 7139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-10-11 06:47:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1544. [2024-10-11 06:47:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1530 states have (on average 1.4705882352941178) internal successors, (2250), 1530 states have internal predecessors, (2250), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 06:47:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2274 transitions. [2024-10-11 06:47:27,939 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2274 transitions. Word has length 232 [2024-10-11 06:47:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2274 transitions. [2024-10-11 06:47:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2274 transitions. [2024-10-11 06:47:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 06:47:27,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:27,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:27,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:47:27,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:27,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1981660773, now seen corresponding path program 1 times [2024-10-11 06:47:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404655744] [2024-10-11 06:47:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404655744] [2024-10-11 06:47:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404655744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:28,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660439256] [2024-10-11 06:47:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:28,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:28,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:28,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:28,484 INFO L87 Difference]: Start difference. First operand 1544 states and 2274 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:28,581 INFO L93 Difference]: Finished difference Result 2819 states and 4160 transitions. [2024-10-11 06:47:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:28,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-10-11 06:47:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:28,586 INFO L225 Difference]: With dead ends: 2819 [2024-10-11 06:47:28,586 INFO L226 Difference]: Without dead ends: 1718 [2024-10-11 06:47:28,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:28,588 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 342 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:28,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 4859 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2024-10-11 06:47:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1576. [2024-10-11 06:47:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1562 states have (on average 1.469910371318822) internal successors, (2296), 1562 states have internal predecessors, (2296), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 06:47:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2320 transitions. [2024-10-11 06:47:28,618 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2320 transitions. Word has length 232 [2024-10-11 06:47:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:28,618 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2320 transitions. [2024-10-11 06:47:28,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2320 transitions. [2024-10-11 06:47:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 06:47:28,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:28,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:28,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 06:47:28,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:28,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1390231999, now seen corresponding path program 1 times [2024-10-11 06:47:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:28,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181220728] [2024-10-11 06:47:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 06:47:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181220728] [2024-10-11 06:47:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181220728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587319921] [2024-10-11 06:47:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:29,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:29,052 INFO L87 Difference]: Start difference. First operand 1576 states and 2320 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:29,133 INFO L93 Difference]: Finished difference Result 3155 states and 4649 transitions. [2024-10-11 06:47:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-10-11 06:47:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:29,140 INFO L225 Difference]: With dead ends: 3155 [2024-10-11 06:47:29,140 INFO L226 Difference]: Without dead ends: 2054 [2024-10-11 06:47:29,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:29,142 INFO L432 NwaCegarLoop]: 1288 mSDtfsCounter, 196 mSDsluCounter, 4834 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 6122 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:29,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 6122 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-10-11 06:47:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2050. [2024-10-11 06:47:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2030 states have (on average 1.467487684729064) internal successors, (2979), 2030 states have internal predecessors, (2979), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 06:47:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3015 transitions. [2024-10-11 06:47:29,179 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3015 transitions. Word has length 232 [2024-10-11 06:47:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 3015 transitions. [2024-10-11 06:47:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3015 transitions. [2024-10-11 06:47:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 06:47:29,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:29,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:47:29,184 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1168601156, now seen corresponding path program 1 times [2024-10-11 06:47:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132174260] [2024-10-11 06:47:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:29,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132174260] [2024-10-11 06:47:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132174260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424945744] [2024-10-11 06:47:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:29,672 INFO L87 Difference]: Start difference. First operand 2050 states and 3015 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:29,767 INFO L93 Difference]: Finished difference Result 3293 states and 4853 transitions. [2024-10-11 06:47:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2024-10-11 06:47:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:29,773 INFO L225 Difference]: With dead ends: 3293 [2024-10-11 06:47:29,774 INFO L226 Difference]: Without dead ends: 2192 [2024-10-11 06:47:29,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:29,777 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 335 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:29,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 4859 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2024-10-11 06:47:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2066. [2024-10-11 06:47:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2046 states have (on average 1.4667644183773216) internal successors, (3001), 2046 states have internal predecessors, (3001), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 06:47:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3037 transitions. [2024-10-11 06:47:29,816 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3037 transitions. Word has length 233 [2024-10-11 06:47:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:29,816 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 3037 transitions. [2024-10-11 06:47:29,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3037 transitions. [2024-10-11 06:47:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 06:47:29,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:29,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:29,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:47:29,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:29,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1445870844, now seen corresponding path program 1 times [2024-10-11 06:47:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129918845] [2024-10-11 06:47:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 06:47:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129918845] [2024-10-11 06:47:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129918845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:30,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:30,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590095568] [2024-10-11 06:47:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:30,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:30,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:30,268 INFO L87 Difference]: Start difference. First operand 2066 states and 3037 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:30,350 INFO L93 Difference]: Finished difference Result 3175 states and 4675 transitions. [2024-10-11 06:47:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:30,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2024-10-11 06:47:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:30,356 INFO L225 Difference]: With dead ends: 3175 [2024-10-11 06:47:30,356 INFO L226 Difference]: Without dead ends: 2074 [2024-10-11 06:47:30,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:30,358 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 869 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:30,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 3884 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-10-11 06:47:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2070. [2024-10-11 06:47:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 2050 states have (on average 1.4658536585365853) internal successors, (3005), 2050 states have internal predecessors, (3005), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 06:47:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 3041 transitions. [2024-10-11 06:47:30,389 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 3041 transitions. Word has length 233 [2024-10-11 06:47:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:30,389 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 3041 transitions. [2024-10-11 06:47:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 3041 transitions. [2024-10-11 06:47:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 06:47:30,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:30,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:30,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 06:47:30,396 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash 955005821, now seen corresponding path program 1 times [2024-10-11 06:47:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571440601] [2024-10-11 06:47:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571440601] [2024-10-11 06:47:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571440601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:31,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:47:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331413969] [2024-10-11 06:47:31,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:31,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:47:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:47:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:31,393 INFO L87 Difference]: Start difference. First operand 2070 states and 3041 transitions. Second operand has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:31,675 INFO L93 Difference]: Finished difference Result 3421 states and 5039 transitions. [2024-10-11 06:47:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:31,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2024-10-11 06:47:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:31,682 INFO L225 Difference]: With dead ends: 3421 [2024-10-11 06:47:31,682 INFO L226 Difference]: Without dead ends: 2316 [2024-10-11 06:47:31,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:31,684 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 2034 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 3798 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:31,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 3798 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2024-10-11 06:47:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2314. [2024-10-11 06:47:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2294 states have (on average 1.468613775065388) internal successors, (3369), 2294 states have internal predecessors, (3369), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 06:47:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3405 transitions. [2024-10-11 06:47:31,729 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3405 transitions. Word has length 233 [2024-10-11 06:47:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:31,729 INFO L471 AbstractCegarLoop]: Abstraction has 2314 states and 3405 transitions. [2024-10-11 06:47:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3405 transitions. [2024-10-11 06:47:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 06:47:31,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:31,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 06:47:31,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1577035190, now seen corresponding path program 1 times [2024-10-11 06:47:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053039789] [2024-10-11 06:47:31,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:32,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:32,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:32,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053039789] [2024-10-11 06:47:32,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053039789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:32,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:32,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220428015] [2024-10-11 06:47:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:32,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:32,584 INFO L87 Difference]: Start difference. First operand 2314 states and 3405 transitions. Second operand has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:32,892 INFO L93 Difference]: Finished difference Result 4286 states and 6315 transitions. [2024-10-11 06:47:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234 [2024-10-11 06:47:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:32,900 INFO L225 Difference]: With dead ends: 4286 [2024-10-11 06:47:32,900 INFO L226 Difference]: Without dead ends: 2877 [2024-10-11 06:47:32,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:32,903 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 1377 mSDsluCounter, 3566 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:32,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 4468 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2024-10-11 06:47:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2699. [2024-10-11 06:47:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2673 states have (on average 1.46539468761691) internal successors, (3917), 2673 states have internal predecessors, (3917), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3965 transitions. [2024-10-11 06:47:32,951 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3965 transitions. Word has length 234 [2024-10-11 06:47:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:32,952 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 3965 transitions. [2024-10-11 06:47:32,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3965 transitions. [2024-10-11 06:47:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 06:47:32,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:32,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:32,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 06:47:32,957 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2115799610, now seen corresponding path program 1 times [2024-10-11 06:47:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:32,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743018390] [2024-10-11 06:47:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:33,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743018390] [2024-10-11 06:47:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743018390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972806660] [2024-10-11 06:47:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:33,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:33,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:33,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:33,434 INFO L87 Difference]: Start difference. First operand 2699 states and 3965 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:33,534 INFO L93 Difference]: Finished difference Result 4178 states and 6151 transitions. [2024-10-11 06:47:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2024-10-11 06:47:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:33,541 INFO L225 Difference]: With dead ends: 4178 [2024-10-11 06:47:33,542 INFO L226 Difference]: Without dead ends: 2829 [2024-10-11 06:47:33,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:33,544 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 325 mSDsluCounter, 3891 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:33,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 4864 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2024-10-11 06:47:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2735. [2024-10-11 06:47:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2709 states have (on average 1.4643779992617203) internal successors, (3967), 2709 states have internal predecessors, (3967), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4015 transitions. [2024-10-11 06:47:33,582 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4015 transitions. Word has length 235 [2024-10-11 06:47:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:33,583 INFO L471 AbstractCegarLoop]: Abstraction has 2735 states and 4015 transitions. [2024-10-11 06:47:33,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4015 transitions. [2024-10-11 06:47:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-11 06:47:33,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:33,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:33,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 06:47:33,588 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:33,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1877249771, now seen corresponding path program 1 times [2024-10-11 06:47:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:33,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605677240] [2024-10-11 06:47:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:34,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605677240] [2024-10-11 06:47:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605677240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:47:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208669996] [2024-10-11 06:47:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:34,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:47:34,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:47:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:34,204 INFO L87 Difference]: Start difference. First operand 2735 states and 4015 transitions. Second operand has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:34,532 INFO L93 Difference]: Finished difference Result 7172 states and 10553 transitions. [2024-10-11 06:47:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:34,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 235 [2024-10-11 06:47:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:34,541 INFO L225 Difference]: With dead ends: 7172 [2024-10-11 06:47:34,542 INFO L226 Difference]: Without dead ends: 5039 [2024-10-11 06:47:34,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:47:34,546 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 3893 mSDsluCounter, 3853 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3894 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:34,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3894 Valid, 4789 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2024-10-11 06:47:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 2903. [2024-10-11 06:47:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2869 states have (on average 1.457999302892994) internal successors, (4183), 2869 states have internal predecessors, (4183), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4247 transitions. [2024-10-11 06:47:34,595 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4247 transitions. Word has length 235 [2024-10-11 06:47:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:34,596 INFO L471 AbstractCegarLoop]: Abstraction has 2903 states and 4247 transitions. [2024-10-11 06:47:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4247 transitions. [2024-10-11 06:47:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 06:47:34,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:34,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 06:47:34,600 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1124747227, now seen corresponding path program 1 times [2024-10-11 06:47:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608133865] [2024-10-11 06:47:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608133865] [2024-10-11 06:47:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608133865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383021932] [2024-10-11 06:47:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:35,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:35,188 INFO L87 Difference]: Start difference. First operand 2903 states and 4247 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:35,511 INFO L93 Difference]: Finished difference Result 4500 states and 6603 transitions. [2024-10-11 06:47:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:35,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 236 [2024-10-11 06:47:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:35,519 INFO L225 Difference]: With dead ends: 4500 [2024-10-11 06:47:35,519 INFO L226 Difference]: Without dead ends: 3081 [2024-10-11 06:47:35,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:35,522 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 1561 mSDsluCounter, 3561 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:35,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 4463 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:47:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2024-10-11 06:47:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2935. [2024-10-11 06:47:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2901 states have (on average 1.4570837642192347) internal successors, (4227), 2901 states have internal predecessors, (4227), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4291 transitions. [2024-10-11 06:47:35,564 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4291 transitions. Word has length 236 [2024-10-11 06:47:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:35,564 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 4291 transitions. [2024-10-11 06:47:35,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4291 transitions. [2024-10-11 06:47:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 06:47:35,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:35,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:35,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 06:47:35,568 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash -687871583, now seen corresponding path program 1 times [2024-10-11 06:47:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43745339] [2024-10-11 06:47:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43745339] [2024-10-11 06:47:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43745339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449840022] [2024-10-11 06:47:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:35,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:35,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:35,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:35,958 INFO L87 Difference]: Start difference. First operand 2935 states and 4291 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:36,069 INFO L93 Difference]: Finished difference Result 5392 states and 7914 transitions. [2024-10-11 06:47:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2024-10-11 06:47:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:36,074 INFO L225 Difference]: With dead ends: 5392 [2024-10-11 06:47:36,075 INFO L226 Difference]: Without dead ends: 3761 [2024-10-11 06:47:36,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:36,077 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 847 mSDsluCounter, 3886 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 4857 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:36,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 4857 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2024-10-11 06:47:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 2967. [2024-10-11 06:47:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2933 states have (on average 1.4561882032049096) internal successors, (4271), 2933 states have internal predecessors, (4271), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 4335 transitions. [2024-10-11 06:47:36,117 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 4335 transitions. Word has length 237 [2024-10-11 06:47:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:36,117 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 4335 transitions. [2024-10-11 06:47:36,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 4335 transitions. [2024-10-11 06:47:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 06:47:36,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:36,121 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 06:47:36,121 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:36,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash -311363006, now seen corresponding path program 1 times [2024-10-11 06:47:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491058424] [2024-10-11 06:47:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491058424] [2024-10-11 06:47:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491058424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:36,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692530527] [2024-10-11 06:47:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:36,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:36,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:36,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:36,670 INFO L87 Difference]: Start difference. First operand 2967 states and 4335 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:36,894 INFO L93 Difference]: Finished difference Result 5182 states and 7599 transitions. [2024-10-11 06:47:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:36,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2024-10-11 06:47:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:36,899 INFO L225 Difference]: With dead ends: 5182 [2024-10-11 06:47:36,900 INFO L226 Difference]: Without dead ends: 2967 [2024-10-11 06:47:36,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:36,902 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 938 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:36,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 2896 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-11 06:47:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2799. [2024-10-11 06:47:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2773 states have (on average 1.4594302199783629) internal successors, (4047), 2773 states have internal predecessors, (4047), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 4095 transitions. [2024-10-11 06:47:36,937 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 4095 transitions. Word has length 237 [2024-10-11 06:47:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 2799 states and 4095 transitions. [2024-10-11 06:47:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 4095 transitions. [2024-10-11 06:47:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 06:47:36,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:36,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:36,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 06:47:36,942 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:36,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1708460671, now seen corresponding path program 1 times [2024-10-11 06:47:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:36,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477601703] [2024-10-11 06:47:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:36,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:37,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477601703] [2024-10-11 06:47:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477601703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6547290] [2024-10-11 06:47:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:37,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:37,309 INFO L87 Difference]: Start difference. First operand 2799 states and 4095 transitions. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:37,425 INFO L93 Difference]: Finished difference Result 5166 states and 7585 transitions. [2024-10-11 06:47:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2024-10-11 06:47:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:37,430 INFO L225 Difference]: With dead ends: 5166 [2024-10-11 06:47:37,431 INFO L226 Difference]: Without dead ends: 3593 [2024-10-11 06:47:37,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:37,433 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 840 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 4852 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:37,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 4852 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-10-11 06:47:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2831. [2024-10-11 06:47:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2805 states have (on average 1.4584670231729056) internal successors, (4091), 2805 states have internal predecessors, (4091), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 4139 transitions. [2024-10-11 06:47:37,474 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 4139 transitions. Word has length 238 [2024-10-11 06:47:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 4139 transitions. [2024-10-11 06:47:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 4139 transitions. [2024-10-11 06:47:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 06:47:37,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:37,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 06:47:37,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash -485437042, now seen corresponding path program 1 times [2024-10-11 06:47:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000098484] [2024-10-11 06:47:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000098484] [2024-10-11 06:47:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000098484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:37,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509517555] [2024-10-11 06:47:37,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:37,997 INFO L87 Difference]: Start difference. First operand 2831 states and 4139 transitions. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:38,098 INFO L93 Difference]: Finished difference Result 4290 states and 6293 transitions. [2024-10-11 06:47:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:38,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2024-10-11 06:47:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:38,103 INFO L225 Difference]: With dead ends: 4290 [2024-10-11 06:47:38,103 INFO L226 Difference]: Without dead ends: 2925 [2024-10-11 06:47:38,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:38,105 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 316 mSDsluCounter, 3881 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 4851 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:38,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 4851 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2024-10-11 06:47:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2847. [2024-10-11 06:47:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2821 states have (on average 1.4579936192839418) internal successors, (4113), 2821 states have internal predecessors, (4113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 4161 transitions. [2024-10-11 06:47:38,143 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 4161 transitions. Word has length 238 [2024-10-11 06:47:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:38,143 INFO L471 AbstractCegarLoop]: Abstraction has 2847 states and 4161 transitions. [2024-10-11 06:47:38,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 4161 transitions. [2024-10-11 06:47:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 06:47:38,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:38,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:38,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 06:47:38,147 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash -569935755, now seen corresponding path program 1 times [2024-10-11 06:47:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:38,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578117708] [2024-10-11 06:47:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:38,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:38,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578117708] [2024-10-11 06:47:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578117708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:38,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:38,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:38,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946533902] [2024-10-11 06:47:38,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:38,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:38,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:38,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:38,721 INFO L87 Difference]: Start difference. First operand 2847 states and 4161 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:38,971 INFO L93 Difference]: Finished difference Result 4756 states and 6969 transitions. [2024-10-11 06:47:38,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:38,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2024-10-11 06:47:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:38,976 INFO L225 Difference]: With dead ends: 4756 [2024-10-11 06:47:38,976 INFO L226 Difference]: Without dead ends: 2847 [2024-10-11 06:47:38,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:38,978 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1050 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:38,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 3633 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2024-10-11 06:47:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2847. [2024-10-11 06:47:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2821 states have (on average 1.4551577454803262) internal successors, (4105), 2821 states have internal predecessors, (4105), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 4153 transitions. [2024-10-11 06:47:39,013 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 4153 transitions. Word has length 238 [2024-10-11 06:47:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:39,013 INFO L471 AbstractCegarLoop]: Abstraction has 2847 states and 4153 transitions. [2024-10-11 06:47:39,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 4153 transitions. [2024-10-11 06:47:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 06:47:39,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:39,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:39,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 06:47:39,018 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:39,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1912456112, now seen corresponding path program 1 times [2024-10-11 06:47:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:39,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141082229] [2024-10-11 06:47:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:39,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:39,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141082229] [2024-10-11 06:47:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141082229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:39,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:39,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867827309] [2024-10-11 06:47:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:39,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:39,388 INFO L87 Difference]: Start difference. First operand 2847 states and 4153 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:39,496 INFO L93 Difference]: Finished difference Result 5182 states and 7590 transitions. [2024-10-11 06:47:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:39,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239 [2024-10-11 06:47:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:39,502 INFO L225 Difference]: With dead ends: 5182 [2024-10-11 06:47:39,502 INFO L226 Difference]: Without dead ends: 3617 [2024-10-11 06:47:39,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:39,504 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 833 mSDsluCounter, 3881 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 4851 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:39,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 4851 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2024-10-11 06:47:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 2879. [2024-10-11 06:47:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2853 states have (on average 1.4542586750788644) internal successors, (4149), 2853 states have internal predecessors, (4149), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 4197 transitions. [2024-10-11 06:47:39,536 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 4197 transitions. Word has length 239 [2024-10-11 06:47:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:39,537 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 4197 transitions. [2024-10-11 06:47:39,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 4197 transitions. [2024-10-11 06:47:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 06:47:39,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:39,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:39,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 06:47:39,540 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:39,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -31314779, now seen corresponding path program 1 times [2024-10-11 06:47:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781643318] [2024-10-11 06:47:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:40,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781643318] [2024-10-11 06:47:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781643318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808619437] [2024-10-11 06:47:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:40,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:40,047 INFO L87 Difference]: Start difference. First operand 2879 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:40,299 INFO L93 Difference]: Finished difference Result 4748 states and 6942 transitions. [2024-10-11 06:47:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239 [2024-10-11 06:47:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:40,304 INFO L225 Difference]: With dead ends: 4748 [2024-10-11 06:47:40,304 INFO L226 Difference]: Without dead ends: 2879 [2024-10-11 06:47:40,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:40,307 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 1044 mSDsluCounter, 2740 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:40,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 3635 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-10-11 06:47:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2879. [2024-10-11 06:47:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2853 states have (on average 1.4514546091833158) internal successors, (4141), 2853 states have internal predecessors, (4141), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 4189 transitions. [2024-10-11 06:47:40,341 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 4189 transitions. Word has length 239 [2024-10-11 06:47:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:40,342 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 4189 transitions. [2024-10-11 06:47:40,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 4189 transitions. [2024-10-11 06:47:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 06:47:40,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:40,348 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:40,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 06:47:40,348 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:40,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash 74122868, now seen corresponding path program 1 times [2024-10-11 06:47:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136475713] [2024-10-11 06:47:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:40,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:40,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136475713] [2024-10-11 06:47:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136475713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:40,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508120939] [2024-10-11 06:47:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:40,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:40,738 INFO L87 Difference]: Start difference. First operand 2879 states and 4189 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:40,855 INFO L93 Difference]: Finished difference Result 5166 states and 7551 transitions. [2024-10-11 06:47:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:40,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 240 [2024-10-11 06:47:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:40,861 INFO L225 Difference]: With dead ends: 5166 [2024-10-11 06:47:40,861 INFO L226 Difference]: Without dead ends: 3617 [2024-10-11 06:47:40,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:40,867 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 826 mSDsluCounter, 3877 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:40,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 4846 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2024-10-11 06:47:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 2911. [2024-10-11 06:47:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2885 states have (on average 1.4506065857885615) internal successors, (4185), 2885 states have internal predecessors, (4185), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4233 transitions. [2024-10-11 06:47:40,906 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4233 transitions. Word has length 240 [2024-10-11 06:47:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:40,906 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 4233 transitions. [2024-10-11 06:47:40,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4233 transitions. [2024-10-11 06:47:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 06:47:40,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:40,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:40,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 06:47:40,911 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:40,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash 863706115, now seen corresponding path program 1 times [2024-10-11 06:47:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:40,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283977317] [2024-10-11 06:47:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:40,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283977317] [2024-10-11 06:47:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283977317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:41,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217267795] [2024-10-11 06:47:41,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:41,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:41,457 INFO L87 Difference]: Start difference. First operand 2911 states and 4233 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:41,750 INFO L93 Difference]: Finished difference Result 4450 states and 6497 transitions. [2024-10-11 06:47:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 240 [2024-10-11 06:47:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:41,756 INFO L225 Difference]: With dead ends: 4450 [2024-10-11 06:47:41,756 INFO L226 Difference]: Without dead ends: 3057 [2024-10-11 06:47:41,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:41,759 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 1533 mSDsluCounter, 3549 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:41,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 4448 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-10-11 06:47:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2927. [2024-10-11 06:47:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2901 states have (on average 1.4495001723543606) internal successors, (4205), 2901 states have internal predecessors, (4205), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4253 transitions. [2024-10-11 06:47:41,789 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4253 transitions. Word has length 240 [2024-10-11 06:47:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:41,790 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 4253 transitions. [2024-10-11 06:47:41,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4253 transitions. [2024-10-11 06:47:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 06:47:41,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:41,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 06:47:41,793 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:41,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash 915558275, now seen corresponding path program 1 times [2024-10-11 06:47:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217680687] [2024-10-11 06:47:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:41,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217680687] [2024-10-11 06:47:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217680687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:42,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194805879] [2024-10-11 06:47:42,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:42,199 INFO L87 Difference]: Start difference. First operand 2927 states and 4253 transitions. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:42,290 INFO L93 Difference]: Finished difference Result 4386 states and 6401 transitions. [2024-10-11 06:47:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:42,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 241 [2024-10-11 06:47:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:42,295 INFO L225 Difference]: With dead ends: 4386 [2024-10-11 06:47:42,295 INFO L226 Difference]: Without dead ends: 3005 [2024-10-11 06:47:42,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:42,296 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 306 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 4853 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:42,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 4853 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2024-10-11 06:47:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2943. [2024-10-11 06:47:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2917 states have (on average 1.4490915323962976) internal successors, (4227), 2917 states have internal predecessors, (4227), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4275 transitions. [2024-10-11 06:47:42,330 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4275 transitions. Word has length 241 [2024-10-11 06:47:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:42,331 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 4275 transitions. [2024-10-11 06:47:42,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4275 transitions. [2024-10-11 06:47:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 06:47:42,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:42,334 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:42,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 06:47:42,335 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:42,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1860851182, now seen corresponding path program 1 times [2024-10-11 06:47:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287412567] [2024-10-11 06:47:42,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:42,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287412567] [2024-10-11 06:47:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287412567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515550744] [2024-10-11 06:47:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:42,865 INFO L87 Difference]: Start difference. First operand 2943 states and 4275 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:43,122 INFO L93 Difference]: Finished difference Result 4454 states and 6499 transitions. [2024-10-11 06:47:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 241 [2024-10-11 06:47:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:43,126 INFO L225 Difference]: With dead ends: 4454 [2024-10-11 06:47:43,126 INFO L226 Difference]: Without dead ends: 3073 [2024-10-11 06:47:43,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:43,128 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 1513 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:43,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 4445 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2024-10-11 06:47:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2979. [2024-10-11 06:47:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2953 states have (on average 1.4483576024381983) internal successors, (4277), 2953 states have internal predecessors, (4277), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4325 transitions. [2024-10-11 06:47:43,156 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4325 transitions. Word has length 241 [2024-10-11 06:47:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:43,157 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 4325 transitions. [2024-10-11 06:47:43,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4325 transitions. [2024-10-11 06:47:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 06:47:43,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:43,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:43,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 06:47:43,160 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 605067978, now seen corresponding path program 1 times [2024-10-11 06:47:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569851139] [2024-10-11 06:47:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569851139] [2024-10-11 06:47:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569851139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:43,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168929837] [2024-10-11 06:47:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:43,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:43,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:43,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:43,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:43,564 INFO L87 Difference]: Start difference. First operand 2979 states and 4325 transitions. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:43,648 INFO L93 Difference]: Finished difference Result 4422 states and 6449 transitions. [2024-10-11 06:47:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:43,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 242 [2024-10-11 06:47:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:43,652 INFO L225 Difference]: With dead ends: 4422 [2024-10-11 06:47:43,652 INFO L226 Difference]: Without dead ends: 3041 [2024-10-11 06:47:43,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:43,654 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 300 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 4853 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:43,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 4853 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2024-10-11 06:47:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2995. [2024-10-11 06:47:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2969 states have (on average 1.447962276860896) internal successors, (4299), 2969 states have internal predecessors, (4299), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4347 transitions. [2024-10-11 06:47:43,683 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 4347 transitions. Word has length 242 [2024-10-11 06:47:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:43,684 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 4347 transitions. [2024-10-11 06:47:43,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4347 transitions. [2024-10-11 06:47:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 06:47:43,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:43,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:43,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 06:47:43,687 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:43,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1040397825, now seen corresponding path program 1 times [2024-10-11 06:47:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:43,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590711421] [2024-10-11 06:47:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:43,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590711421] [2024-10-11 06:47:44,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590711421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:44,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:44,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720026995] [2024-10-11 06:47:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:44,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:44,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:44,221 INFO L87 Difference]: Start difference. First operand 2995 states and 4347 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:44,480 INFO L93 Difference]: Finished difference Result 4470 states and 6519 transitions. [2024-10-11 06:47:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 242 [2024-10-11 06:47:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:44,483 INFO L225 Difference]: With dead ends: 4470 [2024-10-11 06:47:44,483 INFO L226 Difference]: Without dead ends: 3089 [2024-10-11 06:47:44,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:44,485 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 1497 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 4455 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:44,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 4455 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2024-10-11 06:47:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3011. [2024-10-11 06:47:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3011 states, 2985 states have (on average 1.447571189279732) internal successors, (4321), 2985 states have internal predecessors, (4321), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 4369 transitions. [2024-10-11 06:47:44,516 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 4369 transitions. Word has length 242 [2024-10-11 06:47:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:44,517 INFO L471 AbstractCegarLoop]: Abstraction has 3011 states and 4369 transitions. [2024-10-11 06:47:44,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 4369 transitions. [2024-10-11 06:47:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-11 06:47:44,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:44,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 06:47:44,522 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:44,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 99536625, now seen corresponding path program 1 times [2024-10-11 06:47:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:44,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998356957] [2024-10-11 06:47:44,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:44,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:44,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998356957] [2024-10-11 06:47:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998356957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574743228] [2024-10-11 06:47:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:44,912 INFO L87 Difference]: Start difference. First operand 3011 states and 4369 transitions. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:44,990 INFO L93 Difference]: Finished difference Result 4438 states and 6469 transitions. [2024-10-11 06:47:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:44,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 243 [2024-10-11 06:47:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:44,993 INFO L225 Difference]: With dead ends: 4438 [2024-10-11 06:47:44,993 INFO L226 Difference]: Without dead ends: 3057 [2024-10-11 06:47:44,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:44,995 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 294 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 4853 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:44,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 4853 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-10-11 06:47:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3027. [2024-10-11 06:47:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 3001 states have (on average 1.4471842719093635) internal successors, (4343), 3001 states have internal predecessors, (4343), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 4391 transitions. [2024-10-11 06:47:45,028 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 4391 transitions. Word has length 243 [2024-10-11 06:47:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:45,028 INFO L471 AbstractCegarLoop]: Abstraction has 3027 states and 4391 transitions. [2024-10-11 06:47:45,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 4391 transitions. [2024-10-11 06:47:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-11 06:47:45,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:45,032 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:45,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 06:47:45,032 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:45,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1442033600, now seen corresponding path program 1 times [2024-10-11 06:47:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29517] [2024-10-11 06:47:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:45,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29517] [2024-10-11 06:47:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:47:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792002789] [2024-10-11 06:47:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 06:47:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 06:47:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:47:45,806 INFO L87 Difference]: Start difference. First operand 3027 states and 4391 transitions. Second operand has 11 states, 11 states have (on average 21.454545454545453) internal successors, (236), 11 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:46,370 INFO L93 Difference]: Finished difference Result 7766 states and 11273 transitions. [2024-10-11 06:47:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:47:46,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.454545454545453) internal successors, (236), 11 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 243 [2024-10-11 06:47:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:46,376 INFO L225 Difference]: With dead ends: 7766 [2024-10-11 06:47:46,376 INFO L226 Difference]: Without dead ends: 5671 [2024-10-11 06:47:46,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 06:47:46,378 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 1818 mSDsluCounter, 8914 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 10494 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:46,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 10494 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:47:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2024-10-11 06:47:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 3891. [2024-10-11 06:47:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3853 states have (on average 1.4406955618998183) internal successors, (5551), 3853 states have internal predecessors, (5551), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5623 transitions. [2024-10-11 06:47:46,425 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5623 transitions. Word has length 243 [2024-10-11 06:47:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:46,425 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 5623 transitions. [2024-10-11 06:47:46,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.454545454545453) internal successors, (236), 11 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5623 transitions. [2024-10-11 06:47:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 06:47:46,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:46,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:46,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 06:47:46,430 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 569480823, now seen corresponding path program 1 times [2024-10-11 06:47:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50136716] [2024-10-11 06:47:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50136716] [2024-10-11 06:47:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50136716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:47:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720445871] [2024-10-11 06:47:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:47:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:47:46,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:46,732 INFO L87 Difference]: Start difference. First operand 3891 states and 5623 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:46,786 INFO L93 Difference]: Finished difference Result 6214 states and 8993 transitions. [2024-10-11 06:47:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:47:46,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2024-10-11 06:47:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:46,793 INFO L225 Difference]: With dead ends: 6214 [2024-10-11 06:47:46,793 INFO L226 Difference]: Without dead ends: 3939 [2024-10-11 06:47:46,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:46,796 INFO L432 NwaCegarLoop]: 982 mSDtfsCounter, 2 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:46,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3916 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2024-10-11 06:47:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3927. [2024-10-11 06:47:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3889 states have (on average 1.436616096682952) internal successors, (5587), 3889 states have internal predecessors, (5587), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 5659 transitions. [2024-10-11 06:47:46,868 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 5659 transitions. Word has length 244 [2024-10-11 06:47:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 3927 states and 5659 transitions. [2024-10-11 06:47:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 5659 transitions. [2024-10-11 06:47:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 06:47:46,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:46,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:46,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 06:47:46,875 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:46,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2115060205, now seen corresponding path program 1 times [2024-10-11 06:47:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347182710] [2024-10-11 06:47:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:47,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347182710] [2024-10-11 06:47:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347182710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:47,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:47,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:47,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821958557] [2024-10-11 06:47:47,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:47,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:47,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:47,212 INFO L87 Difference]: Start difference. First operand 3927 states and 5659 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:47,254 INFO L93 Difference]: Finished difference Result 6391 states and 9209 transitions. [2024-10-11 06:47:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:47,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2024-10-11 06:47:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:47,259 INFO L225 Difference]: With dead ends: 6391 [2024-10-11 06:47:47,259 INFO L226 Difference]: Without dead ends: 3999 [2024-10-11 06:47:47,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:47,262 INFO L432 NwaCegarLoop]: 982 mSDtfsCounter, 0 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:47,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2940 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2024-10-11 06:47:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2024-10-11 06:47:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3961 states have (on average 1.4286796263569805) internal successors, (5659), 3961 states have internal predecessors, (5659), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5731 transitions. [2024-10-11 06:47:47,301 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5731 transitions. Word has length 244 [2024-10-11 06:47:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:47,301 INFO L471 AbstractCegarLoop]: Abstraction has 3999 states and 5731 transitions. [2024-10-11 06:47:47,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5731 transitions. [2024-10-11 06:47:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 06:47:47,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:47,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:47,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 06:47:47,305 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:47,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1147908943, now seen corresponding path program 1 times [2024-10-11 06:47:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389292320] [2024-10-11 06:47:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:47:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389292320] [2024-10-11 06:47:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389292320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367028941] [2024-10-11 06:47:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:47,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:47,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:47,816 INFO L87 Difference]: Start difference. First operand 3999 states and 5731 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:48,045 INFO L93 Difference]: Finished difference Result 6187 states and 8906 transitions. [2024-10-11 06:47:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2024-10-11 06:47:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:48,050 INFO L225 Difference]: With dead ends: 6187 [2024-10-11 06:47:48,050 INFO L226 Difference]: Without dead ends: 3999 [2024-10-11 06:47:48,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:48,053 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1038 mSDsluCounter, 2733 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:48,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 3627 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2024-10-11 06:47:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2024-10-11 06:47:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3961 states have (on average 1.4266599343600102) internal successors, (5651), 3961 states have internal predecessors, (5651), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5723 transitions. [2024-10-11 06:47:48,094 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5723 transitions. Word has length 244 [2024-10-11 06:47:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:48,094 INFO L471 AbstractCegarLoop]: Abstraction has 3999 states and 5723 transitions. [2024-10-11 06:47:48,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5723 transitions. [2024-10-11 06:47:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 06:47:48,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:48,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:48,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 06:47:48,097 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:48,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -310125616, now seen corresponding path program 1 times [2024-10-11 06:47:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930511669] [2024-10-11 06:47:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:48,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930511669] [2024-10-11 06:47:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930511669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127370999] [2024-10-11 06:47:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:48,592 INFO L87 Difference]: Start difference. First operand 3999 states and 5723 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:48,718 INFO L93 Difference]: Finished difference Result 6597 states and 9503 transitions. [2024-10-11 06:47:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245 [2024-10-11 06:47:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:48,725 INFO L225 Difference]: With dead ends: 6597 [2024-10-11 06:47:48,725 INFO L226 Difference]: Without dead ends: 4763 [2024-10-11 06:47:48,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:48,728 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 818 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 4853 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:48,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 4853 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2024-10-11 06:47:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4031. [2024-10-11 06:47:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 3993 states have (on average 1.4262459303781618) internal successors, (5695), 3993 states have internal predecessors, (5695), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5767 transitions. [2024-10-11 06:47:48,789 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5767 transitions. Word has length 245 [2024-10-11 06:47:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 4031 states and 5767 transitions. [2024-10-11 06:47:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5767 transitions. [2024-10-11 06:47:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 06:47:48,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:48,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:48,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 06:47:48,794 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:48,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1144084513, now seen corresponding path program 1 times [2024-10-11 06:47:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:48,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200873029] [2024-10-11 06:47:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:49,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:47:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200873029] [2024-10-11 06:47:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200873029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677385251] [2024-10-11 06:47:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:49,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:49,294 INFO L87 Difference]: Start difference. First operand 4031 states and 5767 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:49,545 INFO L93 Difference]: Finished difference Result 6179 states and 8879 transitions. [2024-10-11 06:47:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245 [2024-10-11 06:47:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:49,549 INFO L225 Difference]: With dead ends: 6179 [2024-10-11 06:47:49,550 INFO L226 Difference]: Without dead ends: 4031 [2024-10-11 06:47:49,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:49,552 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 1029 mSDsluCounter, 2741 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:49,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 3634 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2024-10-11 06:47:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2024-10-11 06:47:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 3993 states have (on average 1.4242424242424243) internal successors, (5687), 3993 states have internal predecessors, (5687), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5759 transitions. [2024-10-11 06:47:49,591 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5759 transitions. Word has length 245 [2024-10-11 06:47:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 4031 states and 5759 transitions. [2024-10-11 06:47:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5759 transitions. [2024-10-11 06:47:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 06:47:49,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:49,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:49,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 06:47:49,595 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:49,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1237262294, now seen corresponding path program 1 times [2024-10-11 06:47:49,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:49,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087206760] [2024-10-11 06:47:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:49,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:49,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087206760] [2024-10-11 06:47:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087206760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:49,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:49,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507418994] [2024-10-11 06:47:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:49,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:49,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:49,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:49,976 INFO L87 Difference]: Start difference. First operand 4031 states and 5759 transitions. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:50,081 INFO L93 Difference]: Finished difference Result 6581 states and 9464 transitions. [2024-10-11 06:47:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:47:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 246 [2024-10-11 06:47:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:50,086 INFO L225 Difference]: With dead ends: 6581 [2024-10-11 06:47:50,086 INFO L226 Difference]: Without dead ends: 4763 [2024-10-11 06:47:50,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:50,089 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 812 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:50,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 4845 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2024-10-11 06:47:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4063. [2024-10-11 06:47:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4063 states, 4025 states have (on average 1.4238509316770187) internal successors, (5731), 4025 states have internal predecessors, (5731), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 4063 states and 5803 transitions. [2024-10-11 06:47:50,128 INFO L78 Accepts]: Start accepts. Automaton has 4063 states and 5803 transitions. Word has length 246 [2024-10-11 06:47:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:50,128 INFO L471 AbstractCegarLoop]: Abstraction has 4063 states and 5803 transitions. [2024-10-11 06:47:50,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4063 states and 5803 transitions. [2024-10-11 06:47:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 06:47:50,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:50,131 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:50,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 06:47:50,131 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:50,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash 728657729, now seen corresponding path program 1 times [2024-10-11 06:47:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728026307] [2024-10-11 06:47:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:47:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728026307] [2024-10-11 06:47:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728026307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318640969] [2024-10-11 06:47:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:50,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:50,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:50,647 INFO L87 Difference]: Start difference. First operand 4063 states and 5803 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:50,842 INFO L93 Difference]: Finished difference Result 6171 states and 8852 transitions. [2024-10-11 06:47:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 246 [2024-10-11 06:47:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:50,845 INFO L225 Difference]: With dead ends: 6171 [2024-10-11 06:47:50,846 INFO L226 Difference]: Without dead ends: 4063 [2024-10-11 06:47:50,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:50,848 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 1709 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 3616 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:50,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 3616 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2024-10-11 06:47:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4063. [2024-10-11 06:47:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4063 states, 4025 states have (on average 1.4218633540372672) internal successors, (5723), 4025 states have internal predecessors, (5723), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 4063 states and 5795 transitions. [2024-10-11 06:47:50,888 INFO L78 Accepts]: Start accepts. Automaton has 4063 states and 5795 transitions. Word has length 246 [2024-10-11 06:47:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:50,888 INFO L471 AbstractCegarLoop]: Abstraction has 4063 states and 5795 transitions. [2024-10-11 06:47:50,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4063 states and 5795 transitions. [2024-10-11 06:47:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 06:47:50,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:50,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 06:47:50,892 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash -408291006, now seen corresponding path program 1 times [2024-10-11 06:47:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043656206] [2024-10-11 06:47:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043656206] [2024-10-11 06:47:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043656206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034480573] [2024-10-11 06:47:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:51,420 INFO L87 Difference]: Start difference. First operand 4063 states and 5795 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:51,676 INFO L93 Difference]: Finished difference Result 5781 states and 8294 transitions. [2024-10-11 06:47:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:51,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2024-10-11 06:47:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:51,680 INFO L225 Difference]: With dead ends: 5781 [2024-10-11 06:47:51,680 INFO L226 Difference]: Without dead ends: 4141 [2024-10-11 06:47:51,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:51,682 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1231 mSDsluCounter, 3549 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:51,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 4445 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2024-10-11 06:47:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4079. [2024-10-11 06:47:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 4041 states have (on average 1.4216778025241277) internal successors, (5745), 4041 states have internal predecessors, (5745), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 5817 transitions. [2024-10-11 06:47:51,720 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 5817 transitions. Word has length 247 [2024-10-11 06:47:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:51,721 INFO L471 AbstractCegarLoop]: Abstraction has 4079 states and 5817 transitions. [2024-10-11 06:47:51,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 5817 transitions. [2024-10-11 06:47:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 06:47:51,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:51,724 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:51,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 06:47:51,724 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -858384778, now seen corresponding path program 1 times [2024-10-11 06:47:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511126311] [2024-10-11 06:47:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:52,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:47:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:52,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511126311] [2024-10-11 06:47:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511126311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:47:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116582202] [2024-10-11 06:47:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:47:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:47:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:47:52,100 INFO L87 Difference]: Start difference. First operand 4079 states and 5817 transitions. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:52,174 INFO L93 Difference]: Finished difference Result 5749 states and 8244 transitions. [2024-10-11 06:47:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:52,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248 [2024-10-11 06:47:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:52,179 INFO L225 Difference]: With dead ends: 5749 [2024-10-11 06:47:52,179 INFO L226 Difference]: Without dead ends: 4109 [2024-10-11 06:47:52,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:47:52,181 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 281 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 4834 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:52,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 4834 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2024-10-11 06:47:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4095. [2024-10-11 06:47:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 4057 states have (on average 1.4214937145674142) internal successors, (5767), 4057 states have internal predecessors, (5767), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 06:47:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 5839 transitions. [2024-10-11 06:47:52,219 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 5839 transitions. Word has length 248 [2024-10-11 06:47:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:52,219 INFO L471 AbstractCegarLoop]: Abstraction has 4095 states and 5839 transitions. [2024-10-11 06:47:52,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 5839 transitions. [2024-10-11 06:47:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 06:47:52,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:52,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 06:47:52,223 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:52,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1779554069, now seen corresponding path program 1 times [2024-10-11 06:47:52,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:52,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967001681] [2024-10-11 06:47:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:47:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:52,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:52,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967001681] [2024-10-11 06:47:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967001681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:52,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:47:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974223831] [2024-10-11 06:47:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:52,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:47:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:47:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:52,772 INFO L87 Difference]: Start difference. First operand 4095 states and 5839 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:52,950 INFO L93 Difference]: Finished difference Result 6801 states and 9753 transitions. [2024-10-11 06:47:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:47:52,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248 [2024-10-11 06:47:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:52,955 INFO L225 Difference]: With dead ends: 6801 [2024-10-11 06:47:52,955 INFO L226 Difference]: Without dead ends: 4827 [2024-10-11 06:47:52,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:47:52,958 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2503 mSDsluCounter, 4879 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2505 SdHoareTripleChecker+Valid, 5838 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:52,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2505 Valid, 5838 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2024-10-11 06:47:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3803. [2024-10-11 06:47:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 3769 states have (on average 1.421862563014062) internal successors, (5359), 3769 states have internal predecessors, (5359), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 5423 transitions. [2024-10-11 06:47:52,998 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 5423 transitions. Word has length 248 [2024-10-11 06:47:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:52,998 INFO L471 AbstractCegarLoop]: Abstraction has 3803 states and 5423 transitions. [2024-10-11 06:47:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 5423 transitions. [2024-10-11 06:47:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 06:47:53,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:53,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:53,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 06:47:53,002 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:53,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash -990982790, now seen corresponding path program 1 times [2024-10-11 06:47:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517256778] [2024-10-11 06:47:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:53,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:47:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517256778] [2024-10-11 06:47:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517256778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:47:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455893295] [2024-10-11 06:47:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:53,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:47:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:47:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:53,727 INFO L87 Difference]: Start difference. First operand 3803 states and 5423 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:54,065 INFO L93 Difference]: Finished difference Result 6078 states and 8698 transitions. [2024-10-11 06:47:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:47:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248 [2024-10-11 06:47:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:54,073 INFO L225 Difference]: With dead ends: 6078 [2024-10-11 06:47:54,073 INFO L226 Difference]: Without dead ends: 3843 [2024-10-11 06:47:54,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:47:54,076 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 1050 mSDsluCounter, 4464 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:54,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 5345 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:47:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2024-10-11 06:47:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3219. [2024-10-11 06:47:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3193 states have (on average 1.4240526150955215) internal successors, (4547), 3193 states have internal predecessors, (4547), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4595 transitions. [2024-10-11 06:47:54,121 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4595 transitions. Word has length 248 [2024-10-11 06:47:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:54,121 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4595 transitions. [2024-10-11 06:47:54,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4595 transitions. [2024-10-11 06:47:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 06:47:54,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:54,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:54,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 06:47:54,124 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1600099794, now seen corresponding path program 1 times [2024-10-11 06:47:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53486449] [2024-10-11 06:47:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53486449] [2024-10-11 06:47:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53486449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:47:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246953900] [2024-10-11 06:47:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:54,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:47:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:54,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:47:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:54,712 INFO L87 Difference]: Start difference. First operand 3219 states and 4595 transitions. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:54,921 INFO L93 Difference]: Finished difference Result 5682 states and 8165 transitions. [2024-10-11 06:47:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:47:54,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 249 [2024-10-11 06:47:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:54,925 INFO L225 Difference]: With dead ends: 5682 [2024-10-11 06:47:54,925 INFO L226 Difference]: Without dead ends: 3951 [2024-10-11 06:47:54,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:47:54,927 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2490 mSDsluCounter, 5726 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2492 SdHoareTripleChecker+Valid, 6685 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:54,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2492 Valid, 6685 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-11 06:47:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3227. [2024-10-11 06:47:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3201 states have (on average 1.422992814745392) internal successors, (4555), 3201 states have internal predecessors, (4555), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4603 transitions. [2024-10-11 06:47:54,957 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4603 transitions. Word has length 249 [2024-10-11 06:47:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:54,957 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4603 transitions. [2024-10-11 06:47:54,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4603 transitions. [2024-10-11 06:47:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 06:47:54,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:54,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:54,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-11 06:47:54,960 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:54,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1900357158, now seen corresponding path program 1 times [2024-10-11 06:47:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868042314] [2024-10-11 06:47:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868042314] [2024-10-11 06:47:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868042314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:47:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18385620] [2024-10-11 06:47:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:55,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:47:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:55,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:47:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:55,475 INFO L87 Difference]: Start difference. First operand 3227 states and 4603 transitions. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:55,695 INFO L93 Difference]: Finished difference Result 5668 states and 8142 transitions. [2024-10-11 06:47:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:47:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 249 [2024-10-11 06:47:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:55,700 INFO L225 Difference]: With dead ends: 5668 [2024-10-11 06:47:55,700 INFO L226 Difference]: Without dead ends: 3959 [2024-10-11 06:47:55,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:47:55,703 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2384 mSDsluCounter, 5731 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 6690 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:55,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 6690 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:47:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2024-10-11 06:47:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 3235. [2024-10-11 06:47:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3235 states, 3209 states have (on average 1.4219382985353692) internal successors, (4563), 3209 states have internal predecessors, (4563), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 4611 transitions. [2024-10-11 06:47:55,738 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 4611 transitions. Word has length 249 [2024-10-11 06:47:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:55,739 INFO L471 AbstractCegarLoop]: Abstraction has 3235 states and 4611 transitions. [2024-10-11 06:47:55,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4611 transitions. [2024-10-11 06:47:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 06:47:55,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:55,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:55,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-11 06:47:55,742 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:55,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1918798087, now seen corresponding path program 1 times [2024-10-11 06:47:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942175529] [2024-10-11 06:47:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:47:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:47:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942175529] [2024-10-11 06:47:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942175529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:56,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:56,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621401228] [2024-10-11 06:47:56,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:56,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:56,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:56,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:56,328 INFO L87 Difference]: Start difference. First operand 3235 states and 4611 transitions. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:56,559 INFO L93 Difference]: Finished difference Result 4722 states and 6779 transitions. [2024-10-11 06:47:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:47:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 249 [2024-10-11 06:47:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:56,563 INFO L225 Difference]: With dead ends: 4722 [2024-10-11 06:47:56,563 INFO L226 Difference]: Without dead ends: 3297 [2024-10-11 06:47:56,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:56,565 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1224 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 4450 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:56,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 4450 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2024-10-11 06:47:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3251. [2024-10-11 06:47:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 3225 states have (on average 1.4217054263565891) internal successors, (4585), 3225 states have internal predecessors, (4585), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:47:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4633 transitions. [2024-10-11 06:47:56,597 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4633 transitions. Word has length 249 [2024-10-11 06:47:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 4633 transitions. [2024-10-11 06:47:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4633 transitions. [2024-10-11 06:47:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-11 06:47:56,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:56,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:56,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-11 06:47:56,601 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1790139105, now seen corresponding path program 1 times [2024-10-11 06:47:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:56,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297693565] [2024-10-11 06:47:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:57,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:57,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297693565] [2024-10-11 06:47:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297693565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:47:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071193140] [2024-10-11 06:47:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 06:47:57,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:57,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 06:47:57,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:47:57,317 INFO L87 Difference]: Start difference. First operand 3251 states and 4633 transitions. Second operand has 11 states, 11 states have (on average 22.09090909090909) internal successors, (243), 11 states have internal predecessors, (243), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:57,867 INFO L93 Difference]: Finished difference Result 8172 states and 11666 transitions. [2024-10-11 06:47:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:47:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.09090909090909) internal successors, (243), 11 states have internal predecessors, (243), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 250 [2024-10-11 06:47:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:57,874 INFO L225 Difference]: With dead ends: 8172 [2024-10-11 06:47:57,874 INFO L226 Difference]: Without dead ends: 6111 [2024-10-11 06:47:57,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 06:47:57,878 INFO L432 NwaCegarLoop]: 1565 mSDtfsCounter, 2589 mSDsluCounter, 10267 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 11832 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:57,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 11832 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:47:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6111 states. [2024-10-11 06:47:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6111 to 3931. [2024-10-11 06:47:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3897 states have (on average 1.415704387990762) internal successors, (5517), 3897 states have internal predecessors, (5517), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5581 transitions. [2024-10-11 06:47:57,921 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5581 transitions. Word has length 250 [2024-10-11 06:47:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:57,922 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 5581 transitions. [2024-10-11 06:47:57,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.09090909090909) internal successors, (243), 11 states have internal predecessors, (243), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:47:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5581 transitions. [2024-10-11 06:47:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-11 06:47:57,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:57,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:57,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-11 06:47:57,925 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:57,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1364845079, now seen corresponding path program 1 times [2024-10-11 06:47:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555378427] [2024-10-11 06:47:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:47:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:47:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:58,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555378427] [2024-10-11 06:47:58,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555378427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:58,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:47:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968878385] [2024-10-11 06:47:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:58,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:47:58,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:47:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:47:58,451 INFO L87 Difference]: Start difference. First operand 3931 states and 5581 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:58,661 INFO L93 Difference]: Finished difference Result 5994 states and 8552 transitions. [2024-10-11 06:47:58,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:47:58,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 250 [2024-10-11 06:47:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:58,665 INFO L225 Difference]: With dead ends: 5994 [2024-10-11 06:47:58,666 INFO L226 Difference]: Without dead ends: 3931 [2024-10-11 06:47:58,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:47:58,668 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 1696 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 3613 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:58,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 3613 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:47:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2024-10-11 06:47:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3931. [2024-10-11 06:47:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3897 states have (on average 1.413651526815499) internal successors, (5509), 3897 states have internal predecessors, (5509), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5573 transitions. [2024-10-11 06:47:58,706 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5573 transitions. Word has length 250 [2024-10-11 06:47:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:58,706 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 5573 transitions. [2024-10-11 06:47:58,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5573 transitions. [2024-10-11 06:47:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 06:47:58,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:58,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:58,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-11 06:47:58,709 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:58,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 437730013, now seen corresponding path program 1 times [2024-10-11 06:47:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:58,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455534165] [2024-10-11 06:47:58,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:58,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:58,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:58,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:58,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455534165] [2024-10-11 06:47:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455534165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:58,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:58,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:47:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557966605] [2024-10-11 06:47:58,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:47:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:47:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:58,972 INFO L87 Difference]: Start difference. First operand 3931 states and 5573 transitions. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:59,012 INFO L93 Difference]: Finished difference Result 6204 states and 8824 transitions. [2024-10-11 06:47:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:47:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2024-10-11 06:47:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:59,016 INFO L225 Difference]: With dead ends: 6204 [2024-10-11 06:47:59,016 INFO L226 Difference]: Without dead ends: 3979 [2024-10-11 06:47:59,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:47:59,018 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2915 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:59,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3889 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2024-10-11 06:47:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3967. [2024-10-11 06:47:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 3933 states have (on average 1.4098652428171878) internal successors, (5545), 3933 states have internal predecessors, (5545), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 5609 transitions. [2024-10-11 06:47:59,053 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 5609 transitions. Word has length 251 [2024-10-11 06:47:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:59,053 INFO L471 AbstractCegarLoop]: Abstraction has 3967 states and 5609 transitions. [2024-10-11 06:47:59,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 5609 transitions. [2024-10-11 06:47:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 06:47:59,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:59,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:59,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-11 06:47:59,056 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:59,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:59,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2142720063, now seen corresponding path program 1 times [2024-10-11 06:47:59,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:59,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454566312] [2024-10-11 06:47:59,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:47:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:47:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:47:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:47:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:47:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454566312] [2024-10-11 06:47:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454566312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:47:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:47:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:47:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518041969] [2024-10-11 06:47:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:47:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:47:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:47:59,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:47:59,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:59,352 INFO L87 Difference]: Start difference. First operand 3967 states and 5609 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:47:59,385 INFO L93 Difference]: Finished difference Result 6345 states and 8992 transitions. [2024-10-11 06:47:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:47:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2024-10-11 06:47:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:47:59,389 INFO L225 Difference]: With dead ends: 6345 [2024-10-11 06:47:59,389 INFO L226 Difference]: Without dead ends: 4003 [2024-10-11 06:47:59,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:47:59,391 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:47:59,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2928 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:47:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2024-10-11 06:47:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 4003. [2024-10-11 06:47:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4003 states, 3969 states have (on average 1.4061476442428824) internal successors, (5581), 3969 states have internal predecessors, (5581), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:47:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5645 transitions. [2024-10-11 06:47:59,427 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5645 transitions. Word has length 251 [2024-10-11 06:47:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:47:59,428 INFO L471 AbstractCegarLoop]: Abstraction has 4003 states and 5645 transitions. [2024-10-11 06:47:59,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:47:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5645 transitions. [2024-10-11 06:47:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 06:47:59,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:47:59,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:47:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-11 06:47:59,431 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:47:59,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:47:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1937612633, now seen corresponding path program 1 times [2024-10-11 06:47:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:47:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359245755] [2024-10-11 06:47:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:47:59,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:47:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:00,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:00,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359245755] [2024-10-11 06:48:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359245755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:00,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:48:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030938090] [2024-10-11 06:48:00,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:00,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 06:48:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 06:48:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:48:00,187 INFO L87 Difference]: Start difference. First operand 4003 states and 5645 transitions. Second operand has 11 states, 11 states have (on average 22.181818181818183) internal successors, (244), 11 states have internal predecessors, (244), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:00,632 INFO L93 Difference]: Finished difference Result 8472 states and 11991 transitions. [2024-10-11 06:48:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:48:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.181818181818183) internal successors, (244), 11 states have internal predecessors, (244), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 251 [2024-10-11 06:48:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:00,639 INFO L225 Difference]: With dead ends: 8472 [2024-10-11 06:48:00,639 INFO L226 Difference]: Without dead ends: 6271 [2024-10-11 06:48:00,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 06:48:00,642 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 2492 mSDsluCounter, 6523 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 7438 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:00,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 7438 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2024-10-11 06:48:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 4131. [2024-10-11 06:48:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4131 states, 4097 states have (on average 1.3993165731022699) internal successors, (5733), 4097 states have internal predecessors, (5733), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 5797 transitions. [2024-10-11 06:48:00,691 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 5797 transitions. Word has length 251 [2024-10-11 06:48:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:00,691 INFO L471 AbstractCegarLoop]: Abstraction has 4131 states and 5797 transitions. [2024-10-11 06:48:00,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.181818181818183) internal successors, (244), 11 states have internal predecessors, (244), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 5797 transitions. [2024-10-11 06:48:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 06:48:00,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:00,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:00,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-11 06:48:00,695 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash 475516632, now seen corresponding path program 1 times [2024-10-11 06:48:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:00,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63051951] [2024-10-11 06:48:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63051951] [2024-10-11 06:48:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63051951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:01,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:01,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:48:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627884284] [2024-10-11 06:48:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:01,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:48:01,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:48:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:48:01,097 INFO L87 Difference]: Start difference. First operand 4131 states and 5797 transitions. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:01,176 INFO L93 Difference]: Finished difference Result 5796 states and 8194 transitions. [2024-10-11 06:48:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:48:01,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 252 [2024-10-11 06:48:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:01,181 INFO L225 Difference]: With dead ends: 5796 [2024-10-11 06:48:01,181 INFO L226 Difference]: Without dead ends: 4151 [2024-10-11 06:48:01,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:48:01,184 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 272 mSDsluCounter, 3857 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 4822 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:01,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 4822 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4151 states. [2024-10-11 06:48:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4151 to 4147. [2024-10-11 06:48:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4147 states, 4113 states have (on average 1.3992219790906881) internal successors, (5755), 4113 states have internal predecessors, (5755), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5819 transitions. [2024-10-11 06:48:01,221 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5819 transitions. Word has length 252 [2024-10-11 06:48:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:01,221 INFO L471 AbstractCegarLoop]: Abstraction has 4147 states and 5819 transitions. [2024-10-11 06:48:01,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5819 transitions. [2024-10-11 06:48:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 06:48:01,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:01,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:01,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-11 06:48:01,225 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:01,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 166023053, now seen corresponding path program 1 times [2024-10-11 06:48:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:01,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691932780] [2024-10-11 06:48:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:01,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691932780] [2024-10-11 06:48:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691932780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994474935] [2024-10-11 06:48:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:01,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:01,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:01,763 INFO L87 Difference]: Start difference. First operand 4147 states and 5819 transitions. Second operand has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:01,958 INFO L93 Difference]: Finished difference Result 6818 states and 9662 transitions. [2024-10-11 06:48:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 252 [2024-10-11 06:48:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:01,963 INFO L225 Difference]: With dead ends: 6818 [2024-10-11 06:48:01,963 INFO L226 Difference]: Without dead ends: 4895 [2024-10-11 06:48:01,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:01,966 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2375 mSDsluCounter, 5725 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2377 SdHoareTripleChecker+Valid, 6684 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:01,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2377 Valid, 6684 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2024-10-11 06:48:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4155. [2024-10-11 06:48:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 4121 states have (on average 1.3984469788886194) internal successors, (5763), 4121 states have internal predecessors, (5763), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5827 transitions. [2024-10-11 06:48:02,008 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5827 transitions. Word has length 252 [2024-10-11 06:48:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:02,008 INFO L471 AbstractCegarLoop]: Abstraction has 4155 states and 5827 transitions. [2024-10-11 06:48:02,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5827 transitions. [2024-10-11 06:48:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-11 06:48:02,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:02,016 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:02,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-11 06:48:02,016 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:02,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1046101635, now seen corresponding path program 1 times [2024-10-11 06:48:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99765521] [2024-10-11 06:48:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99765521] [2024-10-11 06:48:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99765521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:48:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316043770] [2024-10-11 06:48:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:48:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:48:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:48:02,618 INFO L87 Difference]: Start difference. First operand 4155 states and 5827 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:02,839 INFO L93 Difference]: Finished difference Result 5848 states and 8264 transitions. [2024-10-11 06:48:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:48:02,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 252 [2024-10-11 06:48:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:02,844 INFO L225 Difference]: With dead ends: 5848 [2024-10-11 06:48:02,844 INFO L226 Difference]: Without dead ends: 4201 [2024-10-11 06:48:02,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:02,847 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 1351 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:02,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 4430 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:48:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4201 states. [2024-10-11 06:48:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4201 to 4171. [2024-10-11 06:48:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4137 states have (on average 1.3983562968334542) internal successors, (5785), 4137 states have internal predecessors, (5785), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5849 transitions. [2024-10-11 06:48:02,887 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5849 transitions. Word has length 252 [2024-10-11 06:48:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:02,887 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 5849 transitions. [2024-10-11 06:48:02,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5849 transitions. [2024-10-11 06:48:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-11 06:48:02,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:02,890 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:02,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-11 06:48:02,891 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:02,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash -70176163, now seen corresponding path program 1 times [2024-10-11 06:48:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251554647] [2024-10-11 06:48:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:03,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:03,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251554647] [2024-10-11 06:48:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251554647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:03,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153751278] [2024-10-11 06:48:03,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:03,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:03,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:03,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:03,462 INFO L87 Difference]: Start difference. First operand 4171 states and 5849 transitions. Second operand has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:03,649 INFO L93 Difference]: Finished difference Result 6836 states and 9683 transitions. [2024-10-11 06:48:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2024-10-11 06:48:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:03,655 INFO L225 Difference]: With dead ends: 6836 [2024-10-11 06:48:03,655 INFO L226 Difference]: Without dead ends: 4927 [2024-10-11 06:48:03,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:03,658 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 1784 mSDsluCounter, 5735 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 6694 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:03,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 6694 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2024-10-11 06:48:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4179. [2024-10-11 06:48:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4179 states, 4145 states have (on average 1.3975874547647769) internal successors, (5793), 4145 states have internal predecessors, (5793), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 5857 transitions. [2024-10-11 06:48:03,706 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 5857 transitions. Word has length 253 [2024-10-11 06:48:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:03,706 INFO L471 AbstractCegarLoop]: Abstraction has 4179 states and 5857 transitions. [2024-10-11 06:48:03,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 5857 transitions. [2024-10-11 06:48:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-11 06:48:03,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:03,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:03,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-11 06:48:03,731 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash -250565923, now seen corresponding path program 1 times [2024-10-11 06:48:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394310430] [2024-10-11 06:48:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:04,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:04,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394310430] [2024-10-11 06:48:04,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394310430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:04,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:04,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:04,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282396892] [2024-10-11 06:48:04,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:04,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:04,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:04,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:04,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:04,259 INFO L87 Difference]: Start difference. First operand 4179 states and 5857 transitions. Second operand has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:04,435 INFO L93 Difference]: Finished difference Result 5920 states and 8354 transitions. [2024-10-11 06:48:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2024-10-11 06:48:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:04,440 INFO L225 Difference]: With dead ends: 5920 [2024-10-11 06:48:04,440 INFO L226 Difference]: Without dead ends: 4187 [2024-10-11 06:48:04,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:04,442 INFO L432 NwaCegarLoop]: 953 mSDtfsCounter, 1521 mSDsluCounter, 5696 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:04,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 6649 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2024-10-11 06:48:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 4183. [2024-10-11 06:48:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 4149 states have (on average 1.3972041455772475) internal successors, (5797), 4149 states have internal predecessors, (5797), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5861 transitions. [2024-10-11 06:48:04,482 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5861 transitions. Word has length 253 [2024-10-11 06:48:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:04,482 INFO L471 AbstractCegarLoop]: Abstraction has 4183 states and 5861 transitions. [2024-10-11 06:48:04,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5861 transitions. [2024-10-11 06:48:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-11 06:48:04,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:04,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:04,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-11 06:48:04,486 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:04,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 798139564, now seen corresponding path program 1 times [2024-10-11 06:48:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:04,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801002429] [2024-10-11 06:48:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:05,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:48:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:05,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:48:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801002429] [2024-10-11 06:48:05,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801002429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:05,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:05,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:48:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138468200] [2024-10-11 06:48:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:05,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:48:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:48:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:48:05,079 INFO L87 Difference]: Start difference. First operand 4183 states and 5861 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:05,267 INFO L93 Difference]: Finished difference Result 6288 states and 8866 transitions. [2024-10-11 06:48:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:48:05,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2024-10-11 06:48:05,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:05,271 INFO L225 Difference]: With dead ends: 6288 [2024-10-11 06:48:05,271 INFO L226 Difference]: Without dead ends: 4183 [2024-10-11 06:48:05,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:05,273 INFO L432 NwaCegarLoop]: 890 mSDtfsCounter, 1676 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 3616 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:05,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 3616 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4183 states. [2024-10-11 06:48:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 4123. [2024-10-11 06:48:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4123 states, 4089 states have (on average 1.3961848862802642) internal successors, (5709), 4089 states have internal predecessors, (5709), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5773 transitions. [2024-10-11 06:48:05,308 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5773 transitions. Word has length 253 [2024-10-11 06:48:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 4123 states and 5773 transitions. [2024-10-11 06:48:05,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5773 transitions. [2024-10-11 06:48:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 06:48:05,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:05,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:05,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-11 06:48:05,311 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:05,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1327315079, now seen corresponding path program 1 times [2024-10-11 06:48:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018431665] [2024-10-11 06:48:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:05,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:05,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018431665] [2024-10-11 06:48:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018431665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944715498] [2024-10-11 06:48:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:05,644 INFO L87 Difference]: Start difference. First operand 4123 states and 5773 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:05,688 INFO L93 Difference]: Finished difference Result 6293 states and 8862 transitions. [2024-10-11 06:48:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2024-10-11 06:48:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:05,692 INFO L225 Difference]: With dead ends: 6293 [2024-10-11 06:48:05,692 INFO L226 Difference]: Without dead ends: 4155 [2024-10-11 06:48:05,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:05,694 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:05,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3885 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-10-11 06:48:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4147. [2024-10-11 06:48:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4147 states, 4113 states have (on average 1.3938730853391685) internal successors, (5733), 4113 states have internal predecessors, (5733), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5797 transitions. [2024-10-11 06:48:05,727 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5797 transitions. Word has length 254 [2024-10-11 06:48:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:05,727 INFO L471 AbstractCegarLoop]: Abstraction has 4147 states and 5797 transitions. [2024-10-11 06:48:05,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5797 transitions. [2024-10-11 06:48:05,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 06:48:05,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:05,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:05,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-11 06:48:05,730 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1787394325, now seen corresponding path program 1 times [2024-10-11 06:48:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214199954] [2024-10-11 06:48:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:06,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214199954] [2024-10-11 06:48:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214199954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558491913] [2024-10-11 06:48:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:06,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:06,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:06,044 INFO L87 Difference]: Start difference. First operand 4147 states and 5797 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:06,079 INFO L93 Difference]: Finished difference Result 6399 states and 8990 transitions. [2024-10-11 06:48:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2024-10-11 06:48:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:06,084 INFO L225 Difference]: With dead ends: 6399 [2024-10-11 06:48:06,084 INFO L226 Difference]: Without dead ends: 4183 [2024-10-11 06:48:06,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:06,086 INFO L432 NwaCegarLoop]: 977 mSDtfsCounter, 0 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:06,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2925 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4183 states. [2024-10-11 06:48:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 4183. [2024-10-11 06:48:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 4149 states have (on average 1.3904555314533622) internal successors, (5769), 4149 states have internal predecessors, (5769), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5833 transitions. [2024-10-11 06:48:06,120 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5833 transitions. Word has length 254 [2024-10-11 06:48:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 4183 states and 5833 transitions. [2024-10-11 06:48:06,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5833 transitions. [2024-10-11 06:48:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 06:48:06,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:06,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:06,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-11 06:48:06,124 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:06,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1023951022, now seen corresponding path program 1 times [2024-10-11 06:48:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:06,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71413371] [2024-10-11 06:48:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:48:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:48:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71413371] [2024-10-11 06:48:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71413371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577835669] [2024-10-11 06:48:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:06,910 INFO L87 Difference]: Start difference. First operand 4183 states and 5833 transitions. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:07,206 INFO L93 Difference]: Finished difference Result 6608 states and 9251 transitions. [2024-10-11 06:48:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2024-10-11 06:48:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:07,210 INFO L225 Difference]: With dead ends: 6608 [2024-10-11 06:48:07,210 INFO L226 Difference]: Without dead ends: 4239 [2024-10-11 06:48:07,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:07,212 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 1043 mSDsluCounter, 3694 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:07,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 4573 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:48:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2024-10-11 06:48:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 4199. [2024-10-11 06:48:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 4165 states have (on average 1.3889555822328932) internal successors, (5785), 4165 states have internal predecessors, (5785), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 5849 transitions. [2024-10-11 06:48:07,253 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 5849 transitions. Word has length 254 [2024-10-11 06:48:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 4199 states and 5849 transitions. [2024-10-11 06:48:07,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 5849 transitions. [2024-10-11 06:48:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-11 06:48:07,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:07,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:07,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-11 06:48:07,257 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2003689126, now seen corresponding path program 1 times [2024-10-11 06:48:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249050202] [2024-10-11 06:48:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:48:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:48:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249050202] [2024-10-11 06:48:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249050202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759507112] [2024-10-11 06:48:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:07,969 INFO L87 Difference]: Start difference. First operand 4199 states and 5849 transitions. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:08,346 INFO L93 Difference]: Finished difference Result 6552 states and 9175 transitions. [2024-10-11 06:48:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254 [2024-10-11 06:48:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:08,350 INFO L225 Difference]: With dead ends: 6552 [2024-10-11 06:48:08,350 INFO L226 Difference]: Without dead ends: 4239 [2024-10-11 06:48:08,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:08,352 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 1733 mSDsluCounter, 4435 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 5314 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:08,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 5314 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2024-10-11 06:48:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 3407. [2024-10-11 06:48:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3381 states have (on average 1.3951493640934636) internal successors, (4717), 3381 states have internal predecessors, (4717), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 4765 transitions. [2024-10-11 06:48:08,383 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 4765 transitions. Word has length 254 [2024-10-11 06:48:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:08,383 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 4765 transitions. [2024-10-11 06:48:08,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 4765 transitions. [2024-10-11 06:48:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-11 06:48:08,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:08,386 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-10-11 06:48:08,386 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -658895368, now seen corresponding path program 1 times [2024-10-11 06:48:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979883063] [2024-10-11 06:48:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:09,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:09,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:09,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979883063] [2024-10-11 06:48:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979883063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:09,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:48:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768132952] [2024-10-11 06:48:09,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:48:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:48:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:48:09,146 INFO L87 Difference]: Start difference. First operand 3407 states and 4765 transitions. Second operand has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:09,397 INFO L93 Difference]: Finished difference Result 4892 states and 6906 transitions. [2024-10-11 06:48:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:48:09,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255 [2024-10-11 06:48:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:09,402 INFO L225 Difference]: With dead ends: 4892 [2024-10-11 06:48:09,402 INFO L226 Difference]: Without dead ends: 3437 [2024-10-11 06:48:09,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:09,404 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1252 mSDsluCounter, 3536 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:09,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 4430 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:48:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2024-10-11 06:48:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3423. [2024-10-11 06:48:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3397 states have (on average 1.395054459817486) internal successors, (4739), 3397 states have internal predecessors, (4739), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 4787 transitions. [2024-10-11 06:48:09,450 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 4787 transitions. Word has length 255 [2024-10-11 06:48:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:09,451 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 4787 transitions. [2024-10-11 06:48:09,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 4787 transitions. [2024-10-11 06:48:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 06:48:09,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:09,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-10-11 06:48:09,454 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2104800579, now seen corresponding path program 1 times [2024-10-11 06:48:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014858775] [2024-10-11 06:48:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:09,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014858775] [2024-10-11 06:48:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014858775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:09,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:09,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226486842] [2024-10-11 06:48:09,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:09,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:09,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:09,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:09,768 INFO L87 Difference]: Start difference. First operand 3423 states and 4787 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:09,811 INFO L93 Difference]: Finished difference Result 5038 states and 7102 transitions. [2024-10-11 06:48:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:09,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256 [2024-10-11 06:48:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:09,815 INFO L225 Difference]: With dead ends: 5038 [2024-10-11 06:48:09,815 INFO L226 Difference]: Without dead ends: 3447 [2024-10-11 06:48:09,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:09,818 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:09,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3884 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2024-10-11 06:48:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3441. [2024-10-11 06:48:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 3415 states have (on average 1.393557833089312) internal successors, (4759), 3415 states have internal predecessors, (4759), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4807 transitions. [2024-10-11 06:48:09,851 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4807 transitions. Word has length 256 [2024-10-11 06:48:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 4807 transitions. [2024-10-11 06:48:09,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4807 transitions. [2024-10-11 06:48:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 06:48:09,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:09,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:09,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-10-11 06:48:09,854 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:09,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1410939871, now seen corresponding path program 1 times [2024-10-11 06:48:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398032005] [2024-10-11 06:48:09,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:10,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:10,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:10,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398032005] [2024-10-11 06:48:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398032005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325963576] [2024-10-11 06:48:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:10,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:10,175 INFO L87 Difference]: Start difference. First operand 3441 states and 4807 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:10,207 INFO L93 Difference]: Finished difference Result 5104 states and 7184 transitions. [2024-10-11 06:48:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256 [2024-10-11 06:48:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:10,210 INFO L225 Difference]: With dead ends: 5104 [2024-10-11 06:48:10,211 INFO L226 Difference]: Without dead ends: 3459 [2024-10-11 06:48:10,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:10,213 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 0 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:10,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2922 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2024-10-11 06:48:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3459. [2024-10-11 06:48:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3433 states have (on average 1.392076900669968) internal successors, (4779), 3433 states have internal predecessors, (4779), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4827 transitions. [2024-10-11 06:48:10,245 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4827 transitions. Word has length 256 [2024-10-11 06:48:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:10,246 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4827 transitions. [2024-10-11 06:48:10,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4827 transitions. [2024-10-11 06:48:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 06:48:10,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:10,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:10,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-10-11 06:48:10,248 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:10,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1398418529, now seen corresponding path program 1 times [2024-10-11 06:48:10,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:10,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035346626] [2024-10-11 06:48:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:10,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035346626] [2024-10-11 06:48:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035346626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 06:48:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697087094] [2024-10-11 06:48:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:10,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:48:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:48:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:48:10,852 INFO L87 Difference]: Start difference. First operand 3459 states and 4827 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:11,100 INFO L93 Difference]: Finished difference Result 4946 states and 6970 transitions. [2024-10-11 06:48:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:48:11,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256 [2024-10-11 06:48:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:11,104 INFO L225 Difference]: With dead ends: 4946 [2024-10-11 06:48:11,104 INFO L226 Difference]: Without dead ends: 3479 [2024-10-11 06:48:11,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:48:11,107 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1414 mSDsluCounter, 3523 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:11,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 4417 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:48:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-11 06:48:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3375. [2024-10-11 06:48:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3375 states, 3349 states have (on average 1.3935503135264258) internal successors, (4667), 3349 states have internal predecessors, (4667), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 4715 transitions. [2024-10-11 06:48:11,137 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 4715 transitions. Word has length 256 [2024-10-11 06:48:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:11,138 INFO L471 AbstractCegarLoop]: Abstraction has 3375 states and 4715 transitions. [2024-10-11 06:48:11,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 4715 transitions. [2024-10-11 06:48:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-11 06:48:11,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:11,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:11,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-10-11 06:48:11,141 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:11,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1376506093, now seen corresponding path program 1 times [2024-10-11 06:48:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551381494] [2024-10-11 06:48:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551381494] [2024-10-11 06:48:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551381494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:11,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:11,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:11,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909975807] [2024-10-11 06:48:11,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:11,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:11,642 INFO L87 Difference]: Start difference. First operand 3375 states and 4715 transitions. Second operand has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:11,802 INFO L93 Difference]: Finished difference Result 5000 states and 7042 transitions. [2024-10-11 06:48:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 257 [2024-10-11 06:48:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:11,806 INFO L225 Difference]: With dead ends: 5000 [2024-10-11 06:48:11,806 INFO L226 Difference]: Without dead ends: 3481 [2024-10-11 06:48:11,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:11,808 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 1264 mSDsluCounter, 5695 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 6647 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:11,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 6647 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2024-10-11 06:48:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3417. [2024-10-11 06:48:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3417 states, 3391 states have (on average 1.392214685933353) internal successors, (4721), 3391 states have internal predecessors, (4721), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 4769 transitions. [2024-10-11 06:48:11,835 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 4769 transitions. Word has length 257 [2024-10-11 06:48:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:11,836 INFO L471 AbstractCegarLoop]: Abstraction has 3417 states and 4769 transitions. [2024-10-11 06:48:11,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 4769 transitions. [2024-10-11 06:48:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-11 06:48:11,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:11,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:11,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-10-11 06:48:11,838 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:11,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash 288931430, now seen corresponding path program 1 times [2024-10-11 06:48:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987880426] [2024-10-11 06:48:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987880426] [2024-10-11 06:48:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987880426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:12,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:48:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980386023] [2024-10-11 06:48:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:12,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 06:48:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 06:48:12,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:48:12,540 INFO L87 Difference]: Start difference. First operand 3417 states and 4769 transitions. Second operand has 11 states, 11 states have (on average 22.727272727272727) internal successors, (250), 11 states have internal predecessors, (250), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:13,031 INFO L93 Difference]: Finished difference Result 6671 states and 9293 transitions. [2024-10-11 06:48:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 06:48:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.727272727272727) internal successors, (250), 11 states have internal predecessors, (250), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 257 [2024-10-11 06:48:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:13,036 INFO L225 Difference]: With dead ends: 6671 [2024-10-11 06:48:13,036 INFO L226 Difference]: Without dead ends: 5120 [2024-10-11 06:48:13,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:48:13,038 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 1774 mSDsluCounter, 8784 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 9970 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:13,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 9970 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:48:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2024-10-11 06:48:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 4443. [2024-10-11 06:48:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 4411 states have (on average 1.381319428700975) internal successors, (6093), 4411 states have internal predecessors, (6093), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 6153 transitions. [2024-10-11 06:48:13,074 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 6153 transitions. Word has length 257 [2024-10-11 06:48:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:13,075 INFO L471 AbstractCegarLoop]: Abstraction has 4443 states and 6153 transitions. [2024-10-11 06:48:13,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.727272727272727) internal successors, (250), 11 states have internal predecessors, (250), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 6153 transitions. [2024-10-11 06:48:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 06:48:13,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:13,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:13,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-10-11 06:48:13,078 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:13,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1355586241, now seen corresponding path program 1 times [2024-10-11 06:48:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513401975] [2024-10-11 06:48:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:13,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513401975] [2024-10-11 06:48:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513401975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:13,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961267044] [2024-10-11 06:48:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:13,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:13,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:13,355 INFO L87 Difference]: Start difference. First operand 4443 states and 6153 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:13,398 INFO L93 Difference]: Finished difference Result 5970 states and 8348 transitions. [2024-10-11 06:48:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-10-11 06:48:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:13,402 INFO L225 Difference]: With dead ends: 5970 [2024-10-11 06:48:13,402 INFO L226 Difference]: Without dead ends: 4459 [2024-10-11 06:48:13,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:13,404 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:13,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3884 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2024-10-11 06:48:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4455. [2024-10-11 06:48:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4423 states have (on average 1.3807370562966312) internal successors, (6107), 4423 states have internal predecessors, (6107), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6167 transitions. [2024-10-11 06:48:13,437 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6167 transitions. Word has length 258 [2024-10-11 06:48:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:13,437 INFO L471 AbstractCegarLoop]: Abstraction has 4455 states and 6167 transitions. [2024-10-11 06:48:13,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6167 transitions. [2024-10-11 06:48:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 06:48:13,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:13,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-10-11 06:48:13,440 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1500921563, now seen corresponding path program 1 times [2024-10-11 06:48:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123168130] [2024-10-11 06:48:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123168130] [2024-10-11 06:48:13,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123168130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:13,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:13,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330696001] [2024-10-11 06:48:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:13,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:13,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:13,726 INFO L87 Difference]: Start difference. First operand 4455 states and 6167 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:13,760 INFO L93 Difference]: Finished difference Result 6014 states and 8404 transitions. [2024-10-11 06:48:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-10-11 06:48:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:13,765 INFO L225 Difference]: With dead ends: 6014 [2024-10-11 06:48:13,765 INFO L226 Difference]: Without dead ends: 4473 [2024-10-11 06:48:13,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:13,766 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 0 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:13,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2922 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2024-10-11 06:48:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4473. [2024-10-11 06:48:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 4441 states have (on average 1.3796442242738123) internal successors, (6127), 4441 states have internal predecessors, (6127), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 6187 transitions. [2024-10-11 06:48:13,800 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 6187 transitions. Word has length 258 [2024-10-11 06:48:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:13,800 INFO L471 AbstractCegarLoop]: Abstraction has 4473 states and 6187 transitions. [2024-10-11 06:48:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 6187 transitions. [2024-10-11 06:48:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 06:48:13,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:13,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:13,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-10-11 06:48:13,804 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1077792795, now seen corresponding path program 1 times [2024-10-11 06:48:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:13,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417094992] [2024-10-11 06:48:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:14,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417094992] [2024-10-11 06:48:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417094992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435774786] [2024-10-11 06:48:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:14,325 INFO L87 Difference]: Start difference. First operand 4473 states and 6187 transitions. Second operand has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:14,517 INFO L93 Difference]: Finished difference Result 7306 states and 10218 transitions. [2024-10-11 06:48:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:14,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-10-11 06:48:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:14,522 INFO L225 Difference]: With dead ends: 7306 [2024-10-11 06:48:14,523 INFO L226 Difference]: Without dead ends: 5471 [2024-10-11 06:48:14,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:14,525 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 1776 mSDsluCounter, 5729 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 6687 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:14,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 6687 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5471 states. [2024-10-11 06:48:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5471 to 4533. [2024-10-11 06:48:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4501 states have (on average 1.3785825372139524) internal successors, (6205), 4501 states have internal predecessors, (6205), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 6265 transitions. [2024-10-11 06:48:14,566 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 6265 transitions. Word has length 258 [2024-10-11 06:48:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:14,566 INFO L471 AbstractCegarLoop]: Abstraction has 4533 states and 6265 transitions. [2024-10-11 06:48:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 6265 transitions. [2024-10-11 06:48:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 06:48:14,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:14,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:14,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-10-11 06:48:14,570 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:14,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1562679245, now seen corresponding path program 1 times [2024-10-11 06:48:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621978695] [2024-10-11 06:48:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621978695] [2024-10-11 06:48:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621978695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:15,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 06:48:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198205382] [2024-10-11 06:48:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:15,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:48:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:48:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:48:15,174 INFO L87 Difference]: Start difference. First operand 4533 states and 6265 transitions. Second operand has 10 states, 10 states have (on average 25.1) internal successors, (251), 10 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:15,582 INFO L93 Difference]: Finished difference Result 7670 states and 10562 transitions. [2024-10-11 06:48:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:48:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.1) internal successors, (251), 10 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-10-11 06:48:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:15,588 INFO L225 Difference]: With dead ends: 7670 [2024-10-11 06:48:15,589 INFO L226 Difference]: Without dead ends: 6085 [2024-10-11 06:48:15,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 06:48:15,592 INFO L432 NwaCegarLoop]: 909 mSDtfsCounter, 1421 mSDsluCounter, 6261 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 7170 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:15,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 7170 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2024-10-11 06:48:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 4473. [2024-10-11 06:48:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 4441 states have (on average 1.3823463183967575) internal successors, (6139), 4441 states have internal predecessors, (6139), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 6199 transitions. [2024-10-11 06:48:15,642 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 6199 transitions. Word has length 258 [2024-10-11 06:48:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:15,642 INFO L471 AbstractCegarLoop]: Abstraction has 4473 states and 6199 transitions. [2024-10-11 06:48:15,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.1) internal successors, (251), 10 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 6199 transitions. [2024-10-11 06:48:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-11 06:48:15,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:15,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:15,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-10-11 06:48:15,645 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash -867641444, now seen corresponding path program 1 times [2024-10-11 06:48:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:15,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124392282] [2024-10-11 06:48:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:48:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:48:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124392282] [2024-10-11 06:48:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124392282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:16,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940026290] [2024-10-11 06:48:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:16,437 INFO L87 Difference]: Start difference. First operand 4473 states and 6199 transitions. Second operand has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:16,740 INFO L93 Difference]: Finished difference Result 6914 states and 9629 transitions. [2024-10-11 06:48:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-10-11 06:48:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:16,744 INFO L225 Difference]: With dead ends: 6914 [2024-10-11 06:48:16,744 INFO L226 Difference]: Without dead ends: 4533 [2024-10-11 06:48:16,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:16,747 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 1623 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 4578 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:16,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 4578 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:48:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2024-10-11 06:48:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4497. [2024-10-11 06:48:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4497 states, 4465 states have (on average 1.3802911534154536) internal successors, (6163), 4465 states have internal predecessors, (6163), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 6223 transitions. [2024-10-11 06:48:16,786 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 6223 transitions. Word has length 258 [2024-10-11 06:48:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:16,786 INFO L471 AbstractCegarLoop]: Abstraction has 4497 states and 6223 transitions. [2024-10-11 06:48:16,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 6223 transitions. [2024-10-11 06:48:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 06:48:16,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:16,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:16,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-10-11 06:48:16,789 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1091463799, now seen corresponding path program 1 times [2024-10-11 06:48:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:16,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825385222] [2024-10-11 06:48:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825385222] [2024-10-11 06:48:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825385222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59861432] [2024-10-11 06:48:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:17,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:17,284 INFO L87 Difference]: Start difference. First operand 4497 states and 6223 transitions. Second operand has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:17,460 INFO L93 Difference]: Finished difference Result 6264 states and 8733 transitions. [2024-10-11 06:48:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:17,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 259 [2024-10-11 06:48:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:17,465 INFO L225 Difference]: With dead ends: 6264 [2024-10-11 06:48:17,465 INFO L226 Difference]: Without dead ends: 4571 [2024-10-11 06:48:17,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:17,467 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 1304 mSDsluCounter, 5709 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:17,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 6661 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2024-10-11 06:48:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4501. [2024-10-11 06:48:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4501 states, 4469 states have (on average 1.379950771984784) internal successors, (6167), 4469 states have internal predecessors, (6167), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6227 transitions. [2024-10-11 06:48:17,503 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6227 transitions. Word has length 259 [2024-10-11 06:48:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:17,503 INFO L471 AbstractCegarLoop]: Abstraction has 4501 states and 6227 transitions. [2024-10-11 06:48:17,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6227 transitions. [2024-10-11 06:48:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-11 06:48:17,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:17,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:17,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-10-11 06:48:17,506 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 322354415, now seen corresponding path program 1 times [2024-10-11 06:48:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052998373] [2024-10-11 06:48:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:48:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:48:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:17,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052998373] [2024-10-11 06:48:17,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052998373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:17,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:48:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156451877] [2024-10-11 06:48:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:17,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:48:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:48:17,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:48:17,885 INFO L87 Difference]: Start difference. First operand 4501 states and 6227 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:18,009 INFO L93 Difference]: Finished difference Result 6678 states and 9307 transitions. [2024-10-11 06:48:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:48:18,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 259 [2024-10-11 06:48:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:18,013 INFO L225 Difference]: With dead ends: 6678 [2024-10-11 06:48:18,013 INFO L226 Difference]: Without dead ends: 4549 [2024-10-11 06:48:18,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:18,015 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 876 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 3761 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:18,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 3761 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2024-10-11 06:48:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4525. [2024-10-11 06:48:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4525 states, 4493 states have (on average 1.3752503894947696) internal successors, (6179), 4493 states have internal predecessors, (6179), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 6239 transitions. [2024-10-11 06:48:18,057 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 6239 transitions. Word has length 259 [2024-10-11 06:48:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:18,057 INFO L471 AbstractCegarLoop]: Abstraction has 4525 states and 6239 transitions. [2024-10-11 06:48:18,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 6239 transitions. [2024-10-11 06:48:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-11 06:48:18,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:18,061 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:18,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-10-11 06:48:18,061 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:18,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1547784647, now seen corresponding path program 1 times [2024-10-11 06:48:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:18,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069936662] [2024-10-11 06:48:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:48:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:18,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:48:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:18,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069936662] [2024-10-11 06:48:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069936662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173132530] [2024-10-11 06:48:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:18,328 INFO L87 Difference]: Start difference. First operand 4525 states and 6239 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:18,375 INFO L93 Difference]: Finished difference Result 6622 states and 9195 transitions. [2024-10-11 06:48:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 260 [2024-10-11 06:48:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:18,379 INFO L225 Difference]: With dead ends: 6622 [2024-10-11 06:48:18,379 INFO L226 Difference]: Without dead ends: 4573 [2024-10-11 06:48:18,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:18,381 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 2 mSDsluCounter, 2906 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:18,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3877 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2024-10-11 06:48:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4561. [2024-10-11 06:48:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4561 states, 4529 states have (on average 1.3727092073305365) internal successors, (6217), 4529 states have internal predecessors, (6217), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 6277 transitions. [2024-10-11 06:48:18,422 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 6277 transitions. Word has length 260 [2024-10-11 06:48:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:18,422 INFO L471 AbstractCegarLoop]: Abstraction has 4561 states and 6277 transitions. [2024-10-11 06:48:18,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 6277 transitions. [2024-10-11 06:48:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:18,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:18,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:18,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-10-11 06:48:18,426 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1433049203, now seen corresponding path program 1 times [2024-10-11 06:48:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358713089] [2024-10-11 06:48:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 06:48:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 06:48:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:18,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358713089] [2024-10-11 06:48:18,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358713089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:18,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313971608] [2024-10-11 06:48:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:18,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:18,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:18,906 INFO L87 Difference]: Start difference. First operand 4561 states and 6277 transitions. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:19,074 INFO L93 Difference]: Finished difference Result 6365 states and 8829 transitions. [2024-10-11 06:48:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:19,079 INFO L225 Difference]: With dead ends: 6365 [2024-10-11 06:48:19,079 INFO L226 Difference]: Without dead ends: 4842 [2024-10-11 06:48:19,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:19,081 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 409 mSDsluCounter, 6084 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 7056 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:19,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 7056 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2024-10-11 06:48:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 4810. [2024-10-11 06:48:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4778 states have (on average 1.3689828380075346) internal successors, (6541), 4778 states have internal predecessors, (6541), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 6601 transitions. [2024-10-11 06:48:19,125 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 6601 transitions. Word has length 261 [2024-10-11 06:48:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:19,125 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 6601 transitions. [2024-10-11 06:48:19,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 6601 transitions. [2024-10-11 06:48:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:19,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:19,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:19,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-10-11 06:48:19,128 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:19,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1939902636, now seen corresponding path program 1 times [2024-10-11 06:48:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583254123] [2024-10-11 06:48:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:19,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:19,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583254123] [2024-10-11 06:48:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583254123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:19,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:19,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347183056] [2024-10-11 06:48:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:19,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:19,677 INFO L87 Difference]: Start difference. First operand 4810 states and 6601 transitions. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:19,850 INFO L93 Difference]: Finished difference Result 6407 states and 8883 transitions. [2024-10-11 06:48:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:19,855 INFO L225 Difference]: With dead ends: 6407 [2024-10-11 06:48:19,855 INFO L226 Difference]: Without dead ends: 4884 [2024-10-11 06:48:19,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:19,857 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 1461 mSDsluCounter, 5669 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 6620 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:19,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 6620 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2024-10-11 06:48:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4603. [2024-10-11 06:48:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 4571 states have (on average 1.3719098665499891) internal successors, (6271), 4571 states have internal predecessors, (6271), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 6331 transitions. [2024-10-11 06:48:19,901 INFO L78 Accepts]: Start accepts. Automaton has 4603 states and 6331 transitions. Word has length 261 [2024-10-11 06:48:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:19,902 INFO L471 AbstractCegarLoop]: Abstraction has 4603 states and 6331 transitions. [2024-10-11 06:48:19,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4603 states and 6331 transitions. [2024-10-11 06:48:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:19,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:19,905 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:19,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-10-11 06:48:19,905 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:19,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 948946475, now seen corresponding path program 1 times [2024-10-11 06:48:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146566859] [2024-10-11 06:48:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:48:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:48:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146566859] [2024-10-11 06:48:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146566859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:20,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:20,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:48:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041698807] [2024-10-11 06:48:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:20,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:48:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:48:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:48:20,227 INFO L87 Difference]: Start difference. First operand 4603 states and 6331 transitions. Second operand has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 6 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:20,348 INFO L93 Difference]: Finished difference Result 6764 states and 9365 transitions. [2024-10-11 06:48:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:48:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 6 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:20,352 INFO L225 Difference]: With dead ends: 6764 [2024-10-11 06:48:20,352 INFO L226 Difference]: Without dead ends: 4627 [2024-10-11 06:48:20,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:20,355 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 874 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 3761 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:20,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 3761 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2024-10-11 06:48:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4615. [2024-10-11 06:48:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 4583 states have (on average 1.3709360680776783) internal successors, (6283), 4583 states have internal predecessors, (6283), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6343 transitions. [2024-10-11 06:48:20,397 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6343 transitions. Word has length 261 [2024-10-11 06:48:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:20,398 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 6343 transitions. [2024-10-11 06:48:20,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 6 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6343 transitions. [2024-10-11 06:48:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:20,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:20,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-10-11 06:48:20,401 INFO L396 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -650151924, now seen corresponding path program 1 times [2024-10-11 06:48:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262065232] [2024-10-11 06:48:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 06:48:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 06:48:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262065232] [2024-10-11 06:48:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262065232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102069063] [2024-10-11 06:48:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:21,071 INFO L87 Difference]: Start difference. First operand 4615 states and 6343 transitions. Second operand has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:21,513 INFO L93 Difference]: Finished difference Result 6582 states and 9111 transitions. [2024-10-11 06:48:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:21,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:21,518 INFO L225 Difference]: With dead ends: 6582 [2024-10-11 06:48:21,518 INFO L226 Difference]: Without dead ends: 4801 [2024-10-11 06:48:21,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:21,521 INFO L432 NwaCegarLoop]: 1214 mSDtfsCounter, 1296 mSDsluCounter, 6863 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 8077 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:21,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 8077 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:48:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2024-10-11 06:48:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 4623. [2024-10-11 06:48:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4591 states have (on average 1.3702896972337182) internal successors, (6291), 4591 states have internal predecessors, (6291), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6351 transitions. [2024-10-11 06:48:21,568 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6351 transitions. Word has length 261 [2024-10-11 06:48:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:21,569 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 6351 transitions. [2024-10-11 06:48:21,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.22222222222222) internal successors, (254), 9 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6351 transitions. [2024-10-11 06:48:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:21,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:21,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-10-11 06:48:21,573 INFO L396 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:21,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 749895557, now seen corresponding path program 1 times [2024-10-11 06:48:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107729431] [2024-10-11 06:48:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:22,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107729431] [2024-10-11 06:48:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107729431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 06:48:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489346631] [2024-10-11 06:48:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 06:48:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 06:48:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:48:22,173 INFO L87 Difference]: Start difference. First operand 4623 states and 6351 transitions. Second operand has 12 states, 12 states have (on average 21.166666666666668) internal successors, (254), 12 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:22,600 INFO L93 Difference]: Finished difference Result 8185 states and 11180 transitions. [2024-10-11 06:48:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 06:48:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 21.166666666666668) internal successors, (254), 12 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 261 [2024-10-11 06:48:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:22,606 INFO L225 Difference]: With dead ends: 8185 [2024-10-11 06:48:22,606 INFO L226 Difference]: Without dead ends: 6628 [2024-10-11 06:48:22,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-10-11 06:48:22,609 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 2392 mSDsluCounter, 7532 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 8465 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:22,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 8465 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6628 states. [2024-10-11 06:48:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6628 to 5315. [2024-10-11 06:48:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5315 states, 5283 states have (on average 1.3562369865606663) internal successors, (7165), 5283 states have internal predecessors, (7165), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 7225 transitions. [2024-10-11 06:48:22,657 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 7225 transitions. Word has length 261 [2024-10-11 06:48:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:22,658 INFO L471 AbstractCegarLoop]: Abstraction has 5315 states and 7225 transitions. [2024-10-11 06:48:22,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.166666666666668) internal successors, (254), 12 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 7225 transitions. [2024-10-11 06:48:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:22,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:22,661 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-10-11 06:48:22,662 INFO L396 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1113812183, now seen corresponding path program 1 times [2024-10-11 06:48:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107160050] [2024-10-11 06:48:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107160050] [2024-10-11 06:48:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107160050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524316682] [2024-10-11 06:48:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:22,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:22,937 INFO L87 Difference]: Start difference. First operand 5315 states and 7225 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:22,986 INFO L93 Difference]: Finished difference Result 8825 states and 11956 transitions. [2024-10-11 06:48:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:22,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:22,991 INFO L225 Difference]: With dead ends: 8825 [2024-10-11 06:48:22,991 INFO L226 Difference]: Without dead ends: 5411 [2024-10-11 06:48:22,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:22,995 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:22,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3886 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2024-10-11 06:48:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 5387. [2024-10-11 06:48:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 5355 states have (on average 1.3514472455648927) internal successors, (7237), 5355 states have internal predecessors, (7237), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7297 transitions. [2024-10-11 06:48:23,041 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7297 transitions. Word has length 261 [2024-10-11 06:48:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:23,041 INFO L471 AbstractCegarLoop]: Abstraction has 5387 states and 7297 transitions. [2024-10-11 06:48:23,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7297 transitions. [2024-10-11 06:48:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:23,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:23,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-10-11 06:48:23,045 INFO L396 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1794362637, now seen corresponding path program 1 times [2024-10-11 06:48:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367290695] [2024-10-11 06:48:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:23,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367290695] [2024-10-11 06:48:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367290695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852472770] [2024-10-11 06:48:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:23,354 INFO L87 Difference]: Start difference. First operand 5387 states and 7297 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:23,397 INFO L93 Difference]: Finished difference Result 8166 states and 11115 transitions. [2024-10-11 06:48:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:23,403 INFO L225 Difference]: With dead ends: 8166 [2024-10-11 06:48:23,403 INFO L226 Difference]: Without dead ends: 5441 [2024-10-11 06:48:23,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:23,406 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:23,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2925 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5441 states. [2024-10-11 06:48:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5441 to 5441. [2024-10-11 06:48:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5441 states, 5409 states have (on average 1.3479386208171567) internal successors, (7291), 5409 states have internal predecessors, (7291), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5441 states to 5441 states and 7351 transitions. [2024-10-11 06:48:23,452 INFO L78 Accepts]: Start accepts. Automaton has 5441 states and 7351 transitions. Word has length 261 [2024-10-11 06:48:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:23,452 INFO L471 AbstractCegarLoop]: Abstraction has 5441 states and 7351 transitions. [2024-10-11 06:48:23,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5441 states and 7351 transitions. [2024-10-11 06:48:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:23,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:23,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:23,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-10-11 06:48:23,456 INFO L396 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:23,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash 79845417, now seen corresponding path program 1 times [2024-10-11 06:48:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007490081] [2024-10-11 06:48:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:23,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:23,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007490081] [2024-10-11 06:48:23,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007490081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:23,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:23,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:23,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063463616] [2024-10-11 06:48:23,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:23,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:23,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:23,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:23,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:23,775 INFO L87 Difference]: Start difference. First operand 5441 states and 7351 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:23,828 INFO L93 Difference]: Finished difference Result 8451 states and 11470 transitions. [2024-10-11 06:48:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:23,834 INFO L225 Difference]: With dead ends: 8451 [2024-10-11 06:48:23,834 INFO L226 Difference]: Without dead ends: 5537 [2024-10-11 06:48:23,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:23,838 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:23,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3886 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5537 states. [2024-10-11 06:48:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5537 to 5513. [2024-10-11 06:48:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5513 states, 5481 states have (on average 1.3433679985404123) internal successors, (7363), 5481 states have internal predecessors, (7363), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 7423 transitions. [2024-10-11 06:48:23,895 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 7423 transitions. Word has length 261 [2024-10-11 06:48:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:23,895 INFO L471 AbstractCegarLoop]: Abstraction has 5513 states and 7423 transitions. [2024-10-11 06:48:23,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 7423 transitions. [2024-10-11 06:48:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:23,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:23,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:23,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-10-11 06:48:23,900 INFO L396 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1431855831, now seen corresponding path program 1 times [2024-10-11 06:48:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367798282] [2024-10-11 06:48:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:24,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367798282] [2024-10-11 06:48:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367798282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395065021] [2024-10-11 06:48:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:24,187 INFO L87 Difference]: Start difference. First operand 5513 states and 7423 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:24,237 INFO L93 Difference]: Finished difference Result 8171 states and 11084 transitions. [2024-10-11 06:48:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:24,242 INFO L225 Difference]: With dead ends: 8171 [2024-10-11 06:48:24,242 INFO L226 Difference]: Without dead ends: 5577 [2024-10-11 06:48:24,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:24,245 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 2 mSDsluCounter, 2916 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:24,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3892 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2024-10-11 06:48:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5561. [2024-10-11 06:48:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5561 states, 5529 states have (on average 1.3403870500994755) internal successors, (7411), 5529 states have internal predecessors, (7411), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7471 transitions. [2024-10-11 06:48:24,326 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7471 transitions. Word has length 261 [2024-10-11 06:48:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:24,326 INFO L471 AbstractCegarLoop]: Abstraction has 5561 states and 7471 transitions. [2024-10-11 06:48:24,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7471 transitions. [2024-10-11 06:48:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:24,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:24,330 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:24,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-10-11 06:48:24,330 INFO L396 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:24,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1993754637, now seen corresponding path program 1 times [2024-10-11 06:48:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718176239] [2024-10-11 06:48:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718176239] [2024-10-11 06:48:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718176239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24757088] [2024-10-11 06:48:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:24,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:24,625 INFO L87 Difference]: Start difference. First operand 5561 states and 7471 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:24,664 INFO L93 Difference]: Finished difference Result 8401 states and 11364 transitions. [2024-10-11 06:48:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:24,670 INFO L225 Difference]: With dead ends: 8401 [2024-10-11 06:48:24,670 INFO L226 Difference]: Without dead ends: 5633 [2024-10-11 06:48:24,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:24,673 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:24,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2925 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5633 states. [2024-10-11 06:48:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5633 to 5633. [2024-10-11 06:48:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5633 states, 5601 states have (on average 1.3360114265309766) internal successors, (7483), 5601 states have internal predecessors, (7483), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 7543 transitions. [2024-10-11 06:48:24,721 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 7543 transitions. Word has length 261 [2024-10-11 06:48:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:24,721 INFO L471 AbstractCegarLoop]: Abstraction has 5633 states and 7543 transitions. [2024-10-11 06:48:24,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 7543 transitions. [2024-10-11 06:48:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 06:48:24,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:24,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:24,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-10-11 06:48:24,725 INFO L396 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:24,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash 770822669, now seen corresponding path program 1 times [2024-10-11 06:48:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785469945] [2024-10-11 06:48:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785469945] [2024-10-11 06:48:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785469945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192375633] [2024-10-11 06:48:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:25,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:25,036 INFO L87 Difference]: Start difference. First operand 5633 states and 7543 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:25,078 INFO L93 Difference]: Finished difference Result 9461 states and 12616 transitions. [2024-10-11 06:48:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-10-11 06:48:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:25,086 INFO L225 Difference]: With dead ends: 9461 [2024-10-11 06:48:25,086 INFO L226 Difference]: Without dead ends: 5633 [2024-10-11 06:48:25,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:25,090 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:25,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2925 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5633 states. [2024-10-11 06:48:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5633 to 5633. [2024-10-11 06:48:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5633 states, 5601 states have (on average 1.333868951972862) internal successors, (7471), 5601 states have internal predecessors, (7471), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 7531 transitions. [2024-10-11 06:48:25,144 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 7531 transitions. Word has length 261 [2024-10-11 06:48:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:25,144 INFO L471 AbstractCegarLoop]: Abstraction has 5633 states and 7531 transitions. [2024-10-11 06:48:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 7531 transitions. [2024-10-11 06:48:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 06:48:25,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:25,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:25,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-10-11 06:48:25,148 INFO L396 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1203775717, now seen corresponding path program 1 times [2024-10-11 06:48:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228128336] [2024-10-11 06:48:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:25,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228128336] [2024-10-11 06:48:25,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228128336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:25,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:25,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:25,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971818849] [2024-10-11 06:48:25,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:25,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:25,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:25,598 INFO L87 Difference]: Start difference. First operand 5633 states and 7531 transitions. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:25,807 INFO L93 Difference]: Finished difference Result 9336 states and 12584 transitions. [2024-10-11 06:48:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-10-11 06:48:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:25,815 INFO L225 Difference]: With dead ends: 9336 [2024-10-11 06:48:25,815 INFO L226 Difference]: Without dead ends: 6814 [2024-10-11 06:48:25,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:25,818 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 2518 mSDsluCounter, 5728 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 6685 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:25,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 6685 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2024-10-11 06:48:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5633. [2024-10-11 06:48:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5633 states, 5601 states have (on average 1.333511872879843) internal successors, (7469), 5601 states have internal predecessors, (7469), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 7529 transitions. [2024-10-11 06:48:25,871 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 7529 transitions. Word has length 262 [2024-10-11 06:48:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:25,871 INFO L471 AbstractCegarLoop]: Abstraction has 5633 states and 7529 transitions. [2024-10-11 06:48:25,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 7529 transitions. [2024-10-11 06:48:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 06:48:25,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:25,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:25,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-10-11 06:48:25,875 INFO L396 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1398692309, now seen corresponding path program 1 times [2024-10-11 06:48:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725983629] [2024-10-11 06:48:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:26,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:26,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725983629] [2024-10-11 06:48:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725983629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:26,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944961758] [2024-10-11 06:48:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:26,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:26,586 INFO L87 Difference]: Start difference. First operand 5633 states and 7529 transitions. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:26,967 INFO L93 Difference]: Finished difference Result 7302 states and 9889 transitions. [2024-10-11 06:48:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:48:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-10-11 06:48:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:26,973 INFO L225 Difference]: With dead ends: 7302 [2024-10-11 06:48:26,973 INFO L226 Difference]: Without dead ends: 5649 [2024-10-11 06:48:26,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:26,976 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 1299 mSDsluCounter, 5252 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 6134 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:26,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 6134 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2024-10-11 06:48:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5029. [2024-10-11 06:48:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5029 states, 4997 states have (on average 1.3438062837702622) internal successors, (6715), 4997 states have internal predecessors, (6715), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 6775 transitions. [2024-10-11 06:48:27,026 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 6775 transitions. Word has length 262 [2024-10-11 06:48:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 5029 states and 6775 transitions. [2024-10-11 06:48:27,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 6775 transitions. [2024-10-11 06:48:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 06:48:27,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:27,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-10-11 06:48:27,030 INFO L396 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1253945018, now seen corresponding path program 1 times [2024-10-11 06:48:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670464607] [2024-10-11 06:48:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 06:48:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:27,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670464607] [2024-10-11 06:48:27,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670464607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:27,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:27,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57108732] [2024-10-11 06:48:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:27,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:27,438 INFO L87 Difference]: Start difference. First operand 5029 states and 6775 transitions. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:27,639 INFO L93 Difference]: Finished difference Result 8439 states and 11446 transitions. [2024-10-11 06:48:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-10-11 06:48:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:27,646 INFO L225 Difference]: With dead ends: 8439 [2024-10-11 06:48:27,646 INFO L226 Difference]: Without dead ends: 6074 [2024-10-11 06:48:27,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:27,649 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 1802 mSDsluCounter, 5733 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 6690 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:27,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 6690 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2024-10-11 06:48:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 5035. [2024-10-11 06:48:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5003 states have (on average 1.3433939636218268) internal successors, (6721), 5003 states have internal predecessors, (6721), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 06:48:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6781 transitions. [2024-10-11 06:48:27,704 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6781 transitions. Word has length 262 [2024-10-11 06:48:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:27,704 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 6781 transitions. [2024-10-11 06:48:27,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6781 transitions. [2024-10-11 06:48:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-11 06:48:27,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:27,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:27,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-10-11 06:48:27,708 INFO L396 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -271859277, now seen corresponding path program 1 times [2024-10-11 06:48:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935735845] [2024-10-11 06:48:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:48:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 06:48:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935735845] [2024-10-11 06:48:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935735845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:28,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 06:48:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666953904] [2024-10-11 06:48:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:48:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:28,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:48:28,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:48:28,354 INFO L87 Difference]: Start difference. First operand 5035 states and 6781 transitions. Second operand has 10 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:28,761 INFO L93 Difference]: Finished difference Result 7508 states and 10168 transitions. [2024-10-11 06:48:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:48:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-10-11 06:48:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:28,767 INFO L225 Difference]: With dead ends: 7508 [2024-10-11 06:48:28,767 INFO L226 Difference]: Without dead ends: 5898 [2024-10-11 06:48:28,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 06:48:28,769 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 1611 mSDsluCounter, 6184 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 7083 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:28,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1613 Valid, 7083 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2024-10-11 06:48:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 4287. [2024-10-11 06:48:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 4261 states have (on average 1.347336306031448) internal successors, (5741), 4261 states have internal predecessors, (5741), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 5789 transitions. [2024-10-11 06:48:28,814 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 5789 transitions. Word has length 262 [2024-10-11 06:48:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:28,814 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 5789 transitions. [2024-10-11 06:48:28,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 5789 transitions. [2024-10-11 06:48:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-11 06:48:28,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:28,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:28,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-10-11 06:48:28,817 INFO L396 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:28,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1010838687, now seen corresponding path program 1 times [2024-10-11 06:48:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141832726] [2024-10-11 06:48:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141832726] [2024-10-11 06:48:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141832726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:48:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755674727] [2024-10-11 06:48:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:48:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:48:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:29,094 INFO L87 Difference]: Start difference. First operand 4287 states and 5789 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:29,140 INFO L93 Difference]: Finished difference Result 5873 states and 8038 transitions. [2024-10-11 06:48:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:48:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 263 [2024-10-11 06:48:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:29,144 INFO L225 Difference]: With dead ends: 5873 [2024-10-11 06:48:29,144 INFO L226 Difference]: Without dead ends: 4303 [2024-10-11 06:48:29,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:48:29,146 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 2 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:29,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3880 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-11 06:48:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 4299. [2024-10-11 06:48:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4299 states, 4273 states have (on average 1.346828925813246) internal successors, (5755), 4273 states have internal predecessors, (5755), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 5803 transitions. [2024-10-11 06:48:29,180 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 5803 transitions. Word has length 263 [2024-10-11 06:48:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 4299 states and 5803 transitions. [2024-10-11 06:48:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 5803 transitions. [2024-10-11 06:48:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-11 06:48:29,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:29,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-10-11 06:48:29,184 INFO L396 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash 157096251, now seen corresponding path program 1 times [2024-10-11 06:48:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724288767] [2024-10-11 06:48:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:29,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724288767] [2024-10-11 06:48:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724288767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:29,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:29,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:48:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79505336] [2024-10-11 06:48:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:48:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:48:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:29,502 INFO L87 Difference]: Start difference. First operand 4299 states and 5803 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:29,538 INFO L93 Difference]: Finished difference Result 5917 states and 8094 transitions. [2024-10-11 06:48:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:48:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 263 [2024-10-11 06:48:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:29,542 INFO L225 Difference]: With dead ends: 5917 [2024-10-11 06:48:29,542 INFO L226 Difference]: Without dead ends: 4317 [2024-10-11 06:48:29,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:48:29,544 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 0 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:29,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2919 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:48:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2024-10-11 06:48:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4317. [2024-10-11 06:48:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 4291 states have (on average 1.3458401305057097) internal successors, (5775), 4291 states have internal predecessors, (5775), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 06:48:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5823 transitions. [2024-10-11 06:48:29,580 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5823 transitions. Word has length 263 [2024-10-11 06:48:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:29,580 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 5823 transitions. [2024-10-11 06:48:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5823 transitions. [2024-10-11 06:48:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-11 06:48:29,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:29,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:29,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-10-11 06:48:29,583 INFO L396 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:29,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2094889072, now seen corresponding path program 1 times [2024-10-11 06:48:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342703602] [2024-10-11 06:48:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:29,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 06:48:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 06:48:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342703602] [2024-10-11 06:48:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342703602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:30,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:48:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833935774] [2024-10-11 06:48:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:30,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 06:48:30,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 06:48:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:48:30,364 INFO L87 Difference]: Start difference. First operand 4317 states and 5823 transitions. Second operand has 11 states, 11 states have (on average 23.272727272727273) internal successors, (256), 11 states have internal predecessors, (256), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:30,807 INFO L93 Difference]: Finished difference Result 10717 states and 14483 transitions. [2024-10-11 06:48:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:48:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.272727272727273) internal successors, (256), 11 states have internal predecessors, (256), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 263 [2024-10-11 06:48:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:30,814 INFO L225 Difference]: With dead ends: 10717 [2024-10-11 06:48:30,815 INFO L226 Difference]: Without dead ends: 8251 [2024-10-11 06:48:30,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 06:48:30,818 INFO L432 NwaCegarLoop]: 913 mSDtfsCounter, 3938 mSDsluCounter, 6499 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3939 SdHoareTripleChecker+Valid, 7412 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:30,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3939 Valid, 7412 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 06:48:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8251 states. [2024-10-11 06:48:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8251 to 5513. [2024-10-11 06:48:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5513 states, 5479 states have (on average 1.3361927359007117) internal successors, (7321), 5479 states have internal predecessors, (7321), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 06:48:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 7385 transitions. [2024-10-11 06:48:30,880 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 7385 transitions. Word has length 263 [2024-10-11 06:48:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:48:30,880 INFO L471 AbstractCegarLoop]: Abstraction has 5513 states and 7385 transitions. [2024-10-11 06:48:30,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.272727272727273) internal successors, (256), 11 states have internal predecessors, (256), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 06:48:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 7385 transitions. [2024-10-11 06:48:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-11 06:48:30,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:48:30,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:48:30,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-10-11 06:48:30,884 INFO L396 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:48:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:48:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -393812942, now seen corresponding path program 1 times [2024-10-11 06:48:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:48:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460381299] [2024-10-11 06:48:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:48:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:48:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 06:48:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 06:48:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:48:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 06:48:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:48:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460381299] [2024-10-11 06:48:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460381299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:48:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:48:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:48:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249395193] [2024-10-11 06:48:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:48:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:48:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:48:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:48:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:48:31,309 INFO L87 Difference]: Start difference. First operand 5513 states and 7385 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 06:48:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:48:31,508 INFO L93 Difference]: Finished difference Result 9096 states and 12294 transitions. [2024-10-11 06:48:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:48:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 264 [2024-10-11 06:48:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:48:31,515 INFO L225 Difference]: With dead ends: 9096 [2024-10-11 06:48:31,515 INFO L226 Difference]: Without dead ends: 6659 [2024-10-11 06:48:31,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 06:48:31,519 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 2507 mSDsluCounter, 5723 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:48:31,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 6680 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:48:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2024-10-11 06:48:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 5517.