./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:25:44,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:25:44,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:25:44,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:25:44,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:25:44,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:25:44,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:25:44,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:25:44,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:25:44,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:25:44,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:25:44,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:25:44,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:25:44,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:25:44,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:25:44,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:25:44,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:25:44,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:25:44,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:25:44,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:25:44,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:25:44,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:25:44,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:25:44,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:25:44,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:25:44,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:25:44,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:25:44,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:25:44,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:25:44,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:25:44,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:25:44,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:25:44,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:25:44,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:25:44,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:25:44,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:25:44,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:25:44,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:25:44,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:25:44,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:25:44,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:25:44,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:25:44,336 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2024-10-11 03:25:44,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:25:44,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:25:44,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:25:44,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:25:44,575 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:25:44,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-10-11 03:25:45,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:25:46,151 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:25:46,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-10-11 03:25:46,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/746c9308a/f7b56d0d17454fb1a6dc57ecca70965d/FLAGd0ef9ccce [2024-10-11 03:25:46,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/746c9308a/f7b56d0d17454fb1a6dc57ecca70965d [2024-10-11 03:25:46,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:25:46,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:25:46,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:25:46,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:25:46,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:25:46,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:46,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190c7fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46, skipping insertion in model container [2024-10-11 03:25:46,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:46,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:25:46,876 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/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-10-11 03:25:46,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:25:46,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:25:46,959 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/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-10-11 03:25:46,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:25:46,982 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:25:46,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46 WrapperNode [2024-10-11 03:25:46,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:25:46,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:25:46,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:25:46,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:25:46,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,041 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 496 [2024-10-11 03:25:47,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:25:47,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:25:47,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:25:47,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:25:47,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,084 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 03:25:47,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:25:47,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:25:47,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:25:47,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:25:47,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (1/1) ... [2024-10-11 03:25:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:25:47,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:25:47,145 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 03:25:47,147 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 03:25:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:25:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:25:47,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:25:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:25:47,309 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:25:47,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:25:47,847 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-11 03:25:47,847 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:25:47,894 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:25:47,895 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:25:47,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:47 BoogieIcfgContainer [2024-10-11 03:25:47,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:25:47,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:25:47,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:25:47,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:25:47,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:25:46" (1/3) ... [2024-10-11 03:25:47,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661b2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:47, skipping insertion in model container [2024-10-11 03:25:47,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:46" (2/3) ... [2024-10-11 03:25:47,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661b2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:47, skipping insertion in model container [2024-10-11 03:25:47,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:47" (3/3) ... [2024-10-11 03:25:47,903 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-10-11 03:25:47,917 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:25:47,917 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:25:47,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:25:47,982 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;@5b1ad3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:25:47,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:25:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:25:47,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:48,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:48,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:48,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 224379031, now seen corresponding path program 1 times [2024-10-11 03:25:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518367155] [2024-10-11 03:25:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:48,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518367155] [2024-10-11 03:25:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518367155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:25:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61366712] [2024-10-11 03:25:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:25:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:48,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:25:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:25:48,402 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8) internal successors, (234), 131 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:48,515 INFO L93 Difference]: Finished difference Result 205 states and 361 transitions. [2024-10-11 03:25:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:25:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:25:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:48,536 INFO L225 Difference]: With dead ends: 205 [2024-10-11 03:25:48,536 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 03:25:48,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 03:25:48,544 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:48,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 03:25:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 03:25:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.7751937984496124) internal successors, (229), 129 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 229 transitions. [2024-10-11 03:25:48,592 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 229 transitions. Word has length 34 [2024-10-11 03:25:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 229 transitions. [2024-10-11 03:25:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 229 transitions. [2024-10-11 03:25:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:25:48,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:48,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:25:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:25:48,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1464564711, now seen corresponding path program 1 times [2024-10-11 03:25:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455679285] [2024-10-11 03:25:48,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455679285] [2024-10-11 03:25:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455679285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:48,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:48,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901610308] [2024-10-11 03:25:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:48,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:48,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:48,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:48,782 INFO L87 Difference]: Start difference. First operand 130 states and 229 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:48,860 INFO L93 Difference]: Finished difference Result 205 states and 355 transitions. [2024-10-11 03:25:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:25:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:48,862 INFO L225 Difference]: With dead ends: 205 [2024-10-11 03:25:48,862 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 03:25:48,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:25:48,863 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:48,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 03:25:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 03:25:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.5426356589147288) internal successors, (199), 129 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 199 transitions. [2024-10-11 03:25:48,873 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 199 transitions. Word has length 34 [2024-10-11 03:25:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:48,873 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 199 transitions. [2024-10-11 03:25:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 199 transitions. [2024-10-11 03:25:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:25:48,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:48,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:48,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:25:48,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:48,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1940708535, now seen corresponding path program 1 times [2024-10-11 03:25:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:48,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906128995] [2024-10-11 03:25:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:49,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:49,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906128995] [2024-10-11 03:25:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906128995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:49,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495668805] [2024-10-11 03:25:49,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:49,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:49,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:49,021 INFO L87 Difference]: Start difference. First operand 130 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:49,089 INFO L93 Difference]: Finished difference Result 264 states and 427 transitions. [2024-10-11 03:25:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:49,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:25:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:49,091 INFO L225 Difference]: With dead ends: 264 [2024-10-11 03:25:49,091 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 03:25:49,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:49,093 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 96 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:49,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 344 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 03:25:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-11 03:25:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.574468085106383) internal successors, (296), 188 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 296 transitions. [2024-10-11 03:25:49,115 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 296 transitions. Word has length 63 [2024-10-11 03:25:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:49,115 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 296 transitions. [2024-10-11 03:25:49,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 296 transitions. [2024-10-11 03:25:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:25:49,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:49,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:25:49,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1714080695, now seen corresponding path program 1 times [2024-10-11 03:25:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929047288] [2024-10-11 03:25:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929047288] [2024-10-11 03:25:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929047288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:49,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452177739] [2024-10-11 03:25:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:49,357 INFO L87 Difference]: Start difference. First operand 189 states and 296 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:49,389 INFO L93 Difference]: Finished difference Result 435 states and 708 transitions. [2024-10-11 03:25:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:49,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 03:25:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:49,391 INFO L225 Difference]: With dead ends: 435 [2024-10-11 03:25:49,393 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 03:25:49,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:49,398 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 98 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:49,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 357 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 03:25:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2024-10-11 03:25:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.608695652173913) internal successors, (481), 299 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2024-10-11 03:25:49,414 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 65 [2024-10-11 03:25:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2024-10-11 03:25:49,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2024-10-11 03:25:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:25:49,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:49,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:49,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:25:49,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:49,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1557818661, now seen corresponding path program 1 times [2024-10-11 03:25:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887079154] [2024-10-11 03:25:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:49,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887079154] [2024-10-11 03:25:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887079154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:49,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:49,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333329122] [2024-10-11 03:25:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:49,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:49,540 INFO L87 Difference]: Start difference. First operand 300 states and 481 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:49,585 INFO L93 Difference]: Finished difference Result 752 states and 1235 transitions. [2024-10-11 03:25:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 03:25:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:49,589 INFO L225 Difference]: With dead ends: 752 [2024-10-11 03:25:49,589 INFO L226 Difference]: Without dead ends: 510 [2024-10-11 03:25:49,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:49,593 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:49,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-11 03:25:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 504. [2024-10-11 03:25:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.6242544731610338) internal successors, (817), 503 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 817 transitions. [2024-10-11 03:25:49,620 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 817 transitions. Word has length 67 [2024-10-11 03:25:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:49,621 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 817 transitions. [2024-10-11 03:25:49,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 817 transitions. [2024-10-11 03:25:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:25:49,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:49,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:25:49,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1377171565, now seen corresponding path program 1 times [2024-10-11 03:25:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457290047] [2024-10-11 03:25:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:49,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457290047] [2024-10-11 03:25:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457290047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:49,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:49,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397592994] [2024-10-11 03:25:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:49,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:49,769 INFO L87 Difference]: Start difference. First operand 504 states and 817 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:49,928 INFO L93 Difference]: Finished difference Result 2152 states and 3595 transitions. [2024-10-11 03:25:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:25:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 03:25:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:49,936 INFO L225 Difference]: With dead ends: 2152 [2024-10-11 03:25:49,940 INFO L226 Difference]: Without dead ends: 1706 [2024-10-11 03:25:49,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:25:49,946 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 803 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:49,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1126 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-11 03:25:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 895. [2024-10-11 03:25:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.6409395973154361) internal successors, (1467), 894 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1467 transitions. [2024-10-11 03:25:49,985 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1467 transitions. Word has length 69 [2024-10-11 03:25:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:49,988 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1467 transitions. [2024-10-11 03:25:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1467 transitions. [2024-10-11 03:25:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 03:25:49,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:49,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:49,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:25:49,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -320075454, now seen corresponding path program 1 times [2024-10-11 03:25:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713196153] [2024-10-11 03:25:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:50,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713196153] [2024-10-11 03:25:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713196153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:50,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:50,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115750963] [2024-10-11 03:25:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:50,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:50,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:50,117 INFO L87 Difference]: Start difference. First operand 895 states and 1467 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:50,197 INFO L93 Difference]: Finished difference Result 2608 states and 4348 transitions. [2024-10-11 03:25:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 03:25:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:50,204 INFO L225 Difference]: With dead ends: 2608 [2024-10-11 03:25:50,204 INFO L226 Difference]: Without dead ends: 1771 [2024-10-11 03:25:50,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:25:50,206 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 355 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:50,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 639 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-10-11 03:25:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1324. [2024-10-11 03:25:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.6500377928949357) internal successors, (2183), 1323 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2183 transitions. [2024-10-11 03:25:50,238 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2183 transitions. Word has length 70 [2024-10-11 03:25:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2183 transitions. [2024-10-11 03:25:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2183 transitions. [2024-10-11 03:25:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:25:50,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:50,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:25:50,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1389673738, now seen corresponding path program 1 times [2024-10-11 03:25:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511738100] [2024-10-11 03:25:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:50,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511738100] [2024-10-11 03:25:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511738100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926580196] [2024-10-11 03:25:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:50,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:50,338 INFO L87 Difference]: Start difference. First operand 1324 states and 2183 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:50,439 INFO L93 Difference]: Finished difference Result 3842 states and 6392 transitions. [2024-10-11 03:25:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 03:25:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:50,449 INFO L225 Difference]: With dead ends: 3842 [2024-10-11 03:25:50,449 INFO L226 Difference]: Without dead ends: 2576 [2024-10-11 03:25:50,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:25:50,453 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 353 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:50,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 640 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-10-11 03:25:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1938. [2024-10-11 03:25:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1937 states have (on average 1.6484254001032526) internal successors, (3193), 1937 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3193 transitions. [2024-10-11 03:25:50,506 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3193 transitions. Word has length 71 [2024-10-11 03:25:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:50,506 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 3193 transitions. [2024-10-11 03:25:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3193 transitions. [2024-10-11 03:25:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 03:25:50,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:50,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:50,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:25:50,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash -182030421, now seen corresponding path program 1 times [2024-10-11 03:25:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025920534] [2024-10-11 03:25:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025920534] [2024-10-11 03:25:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025920534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644651868] [2024-10-11 03:25:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:50,583 INFO L87 Difference]: Start difference. First operand 1938 states and 3193 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:50,679 INFO L93 Difference]: Finished difference Result 5598 states and 9288 transitions. [2024-10-11 03:25:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-11 03:25:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:50,691 INFO L225 Difference]: With dead ends: 5598 [2024-10-11 03:25:50,691 INFO L226 Difference]: Without dead ends: 3718 [2024-10-11 03:25:50,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:25:50,696 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 351 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:50,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 647 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2024-10-11 03:25:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 2812. [2024-10-11 03:25:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2811 states have (on average 1.6453219494841693) internal successors, (4625), 2811 states have internal predecessors, (4625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4625 transitions. [2024-10-11 03:25:50,781 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4625 transitions. Word has length 72 [2024-10-11 03:25:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:50,781 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4625 transitions. [2024-10-11 03:25:50,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4625 transitions. [2024-10-11 03:25:50,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:25:50,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:50,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:50,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:25:50,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:50,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:50,783 INFO L85 PathProgramCache]: Analyzing trace with hash 756120180, now seen corresponding path program 1 times [2024-10-11 03:25:50,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:50,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040669182] [2024-10-11 03:25:50,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:50,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040669182] [2024-10-11 03:25:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040669182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976740712] [2024-10-11 03:25:50,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:50,832 INFO L87 Difference]: Start difference. First operand 2812 states and 4625 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:50,890 INFO L93 Difference]: Finished difference Result 6438 states and 10592 transitions. [2024-10-11 03:25:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:25:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:50,904 INFO L225 Difference]: With dead ends: 6438 [2024-10-11 03:25:50,904 INFO L226 Difference]: Without dead ends: 4432 [2024-10-11 03:25:50,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:50,909 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:50,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 403 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2024-10-11 03:25:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 4430. [2024-10-11 03:25:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 4429 states have (on average 1.6297132535561074) internal successors, (7218), 4429 states have internal predecessors, (7218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 7218 transitions. [2024-10-11 03:25:51,007 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 7218 transitions. Word has length 73 [2024-10-11 03:25:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:51,007 INFO L471 AbstractCegarLoop]: Abstraction has 4430 states and 7218 transitions. [2024-10-11 03:25:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 7218 transitions. [2024-10-11 03:25:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:25:51,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:51,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:25:51,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:51,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997516, now seen corresponding path program 1 times [2024-10-11 03:25:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687153240] [2024-10-11 03:25:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687153240] [2024-10-11 03:25:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687153240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938288292] [2024-10-11 03:25:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:51,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:51,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:51,105 INFO L87 Difference]: Start difference. First operand 4430 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:51,194 INFO L93 Difference]: Finished difference Result 9738 states and 15916 transitions. [2024-10-11 03:25:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:25:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:51,215 INFO L225 Difference]: With dead ends: 9738 [2024-10-11 03:25:51,215 INFO L226 Difference]: Without dead ends: 6598 [2024-10-11 03:25:51,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:51,223 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 97 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:51,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2024-10-11 03:25:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6596. [2024-10-11 03:25:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 1.6203184230477634) internal successors, (10686), 6595 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 10686 transitions. [2024-10-11 03:25:51,381 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 10686 transitions. Word has length 73 [2024-10-11 03:25:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:51,381 INFO L471 AbstractCegarLoop]: Abstraction has 6596 states and 10686 transitions. [2024-10-11 03:25:51,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 10686 transitions. [2024-10-11 03:25:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:25:51,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:51,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:51,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:25:51,383 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1743041398, now seen corresponding path program 1 times [2024-10-11 03:25:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099075462] [2024-10-11 03:25:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:51,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099075462] [2024-10-11 03:25:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099075462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:51,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:51,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865664494] [2024-10-11 03:25:51,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:51,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:51,485 INFO L87 Difference]: Start difference. First operand 6596 states and 10686 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:51,627 INFO L93 Difference]: Finished difference Result 14795 states and 24192 transitions. [2024-10-11 03:25:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 03:25:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:51,663 INFO L225 Difference]: With dead ends: 14795 [2024-10-11 03:25:51,663 INFO L226 Difference]: Without dead ends: 9946 [2024-10-11 03:25:51,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:51,677 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 103 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:51,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 451 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2024-10-11 03:25:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9944. [2024-10-11 03:25:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9943 states have (on average 1.6145026651915921) internal successors, (16053), 9943 states have internal predecessors, (16053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 16053 transitions. [2024-10-11 03:25:51,943 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 16053 transitions. Word has length 73 [2024-10-11 03:25:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 16053 transitions. [2024-10-11 03:25:51,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 16053 transitions. [2024-10-11 03:25:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:25:51,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:51,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:51,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:25:51,944 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -313891277, now seen corresponding path program 1 times [2024-10-11 03:25:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:51,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959313669] [2024-10-11 03:25:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959313669] [2024-10-11 03:25:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959313669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322923062] [2024-10-11 03:25:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:52,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:52,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:52,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:52,116 INFO L87 Difference]: Start difference. First operand 9944 states and 16053 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:52,338 INFO L93 Difference]: Finished difference Result 19814 states and 32005 transitions. [2024-10-11 03:25:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:25:52,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:25:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:52,357 INFO L225 Difference]: With dead ends: 19814 [2024-10-11 03:25:52,358 INFO L226 Difference]: Without dead ends: 9946 [2024-10-11 03:25:52,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:25:52,367 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 280 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:52,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 528 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2024-10-11 03:25:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9944. [2024-10-11 03:25:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9943 states have (on average 1.601931006738409) internal successors, (15928), 9943 states have internal predecessors, (15928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 15928 transitions. [2024-10-11 03:25:52,560 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 15928 transitions. Word has length 74 [2024-10-11 03:25:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:52,560 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 15928 transitions. [2024-10-11 03:25:52,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 15928 transitions. [2024-10-11 03:25:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:25:52,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:52,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:25:52,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1838096755, now seen corresponding path program 1 times [2024-10-11 03:25:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:52,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466229601] [2024-10-11 03:25:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:52,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466229601] [2024-10-11 03:25:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466229601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939613359] [2024-10-11 03:25:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:52,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:52,770 INFO L87 Difference]: Start difference. First operand 9944 states and 15928 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:53,067 INFO L93 Difference]: Finished difference Result 28494 states and 45791 transitions. [2024-10-11 03:25:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:25:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 03:25:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:53,102 INFO L225 Difference]: With dead ends: 28494 [2024-10-11 03:25:53,102 INFO L226 Difference]: Without dead ends: 18626 [2024-10-11 03:25:53,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:25:53,114 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 274 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:53,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 530 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18626 states. [2024-10-11 03:25:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18626 to 18624. [2024-10-11 03:25:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18624 states, 18623 states have (on average 1.5880899962412072) internal successors, (29575), 18623 states have internal predecessors, (29575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 29575 transitions. [2024-10-11 03:25:53,559 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 29575 transitions. Word has length 77 [2024-10-11 03:25:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 18624 states and 29575 transitions. [2024-10-11 03:25:53,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 29575 transitions. [2024-10-11 03:25:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:25:53,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:53,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:53,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:25:53,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1131905386, now seen corresponding path program 1 times [2024-10-11 03:25:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372863604] [2024-10-11 03:25:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:25:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372863604] [2024-10-11 03:25:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372863604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:25:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938773500] [2024-10-11 03:25:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:25:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:25:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:25:53,787 INFO L87 Difference]: Start difference. First operand 18624 states and 29575 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:54,068 INFO L93 Difference]: Finished difference Result 19350 states and 30662 transitions. [2024-10-11 03:25:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:25:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 03:25:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:54,109 INFO L225 Difference]: With dead ends: 19350 [2024-10-11 03:25:54,109 INFO L226 Difference]: Without dead ends: 19348 [2024-10-11 03:25:54,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:25:54,119 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:54,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2024-10-11 03:25:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 19348. [2024-10-11 03:25:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19348 states, 19347 states have (on average 1.5656174083837286) internal successors, (30290), 19347 states have internal predecessors, (30290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19348 states to 19348 states and 30290 transitions. [2024-10-11 03:25:54,563 INFO L78 Accepts]: Start accepts. Automaton has 19348 states and 30290 transitions. Word has length 78 [2024-10-11 03:25:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 19348 states and 30290 transitions. [2024-10-11 03:25:54,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19348 states and 30290 transitions. [2024-10-11 03:25:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:25:54,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:54,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:25:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:25:54,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash -89310492, now seen corresponding path program 1 times [2024-10-11 03:25:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186205632] [2024-10-11 03:25:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:25:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186205632] [2024-10-11 03:25:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186205632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525166839] [2024-10-11 03:25:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:54,697 INFO L87 Difference]: Start difference. First operand 19348 states and 30290 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:55,141 INFO L93 Difference]: Finished difference Result 47466 states and 74560 transitions. [2024-10-11 03:25:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:25:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:25:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:55,219 INFO L225 Difference]: With dead ends: 47466 [2024-10-11 03:25:55,219 INFO L226 Difference]: Without dead ends: 38254 [2024-10-11 03:25:55,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:25:55,236 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 448 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:55,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 810 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:25:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38254 states. [2024-10-11 03:25:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38254 to 29790. [2024-10-11 03:25:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29790 states, 29789 states have (on average 1.5638658565242203) internal successors, (46586), 29789 states have internal predecessors, (46586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29790 states to 29790 states and 46586 transitions. [2024-10-11 03:25:56,089 INFO L78 Accepts]: Start accepts. Automaton has 29790 states and 46586 transitions. Word has length 105 [2024-10-11 03:25:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:56,089 INFO L471 AbstractCegarLoop]: Abstraction has 29790 states and 46586 transitions. [2024-10-11 03:25:56,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 29790 states and 46586 transitions. [2024-10-11 03:25:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:25:56,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:56,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:25:56,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:25:56,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:56,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1367539108, now seen corresponding path program 1 times [2024-10-11 03:25:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:56,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292024764] [2024-10-11 03:25:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:25:56,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292024764] [2024-10-11 03:25:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292024764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:56,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:56,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:25:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147036963] [2024-10-11 03:25:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:56,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:25:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:56,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:25:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:25:56,217 INFO L87 Difference]: Start difference. First operand 29790 states and 46586 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:56,803 INFO L93 Difference]: Finished difference Result 51182 states and 80404 transitions. [2024-10-11 03:25:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:25:56,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:25:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:56,895 INFO L225 Difference]: With dead ends: 51182 [2024-10-11 03:25:56,895 INFO L226 Difference]: Without dead ends: 41970 [2024-10-11 03:25:56,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:25:56,914 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 441 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:56,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 932 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:25:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41970 states. [2024-10-11 03:25:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41970 to 40428. [2024-10-11 03:25:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.5644000296831326) internal successors, (63244), 40427 states have internal predecessors, (63244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 63244 transitions. [2024-10-11 03:25:57,919 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 63244 transitions. Word has length 105 [2024-10-11 03:25:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:25:57,919 INFO L471 AbstractCegarLoop]: Abstraction has 40428 states and 63244 transitions. [2024-10-11 03:25:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 63244 transitions. [2024-10-11 03:25:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:25:57,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:25:57,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:25:57,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:25:57,922 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:25:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:25:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 897610726, now seen corresponding path program 1 times [2024-10-11 03:25:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:25:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749285604] [2024-10-11 03:25:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:25:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:25:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:25:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:25:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:25:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749285604] [2024-10-11 03:25:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749285604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:25:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:25:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:25:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281429049] [2024-10-11 03:25:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:25:57,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:25:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:25:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:25:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:57,996 INFO L87 Difference]: Start difference. First operand 40428 states and 63244 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:25:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:25:58,811 INFO L93 Difference]: Finished difference Result 84543 states and 132909 transitions. [2024-10-11 03:25:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:25:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:25:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:25:59,047 INFO L225 Difference]: With dead ends: 84543 [2024-10-11 03:25:59,047 INFO L226 Difference]: Without dead ends: 75101 [2024-10-11 03:25:59,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:25:59,093 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 81 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:25:59,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 365 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:25:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75101 states. [2024-10-11 03:26:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75101 to 74984. [2024-10-11 03:26:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74984 states, 74983 states have (on average 1.567848712374805) internal successors, (117562), 74983 states have internal predecessors, (117562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74984 states to 74984 states and 117562 transitions. [2024-10-11 03:26:00,676 INFO L78 Accepts]: Start accepts. Automaton has 74984 states and 117562 transitions. Word has length 105 [2024-10-11 03:26:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:00,677 INFO L471 AbstractCegarLoop]: Abstraction has 74984 states and 117562 transitions. [2024-10-11 03:26:00,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 74984 states and 117562 transitions. [2024-10-11 03:26:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:26:00,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:00,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:26:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:26:00,680 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1920686877, now seen corresponding path program 1 times [2024-10-11 03:26:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683286666] [2024-10-11 03:26:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:26:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683286666] [2024-10-11 03:26:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683286666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275282091] [2024-10-11 03:26:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:00,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:00,741 INFO L87 Difference]: Start difference. First operand 74984 states and 117562 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:02,669 INFO L93 Difference]: Finished difference Result 223211 states and 349256 transitions. [2024-10-11 03:26:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:02,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-11 03:26:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:02,975 INFO L225 Difference]: With dead ends: 223211 [2024-10-11 03:26:02,975 INFO L226 Difference]: Without dead ends: 148297 [2024-10-11 03:26:03,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:03,027 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 131 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:03,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 440 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148297 states. [2024-10-11 03:26:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148297 to 148295. [2024-10-11 03:26:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148295 states, 148294 states have (on average 1.5518834207722496) internal successors, (230135), 148294 states have internal predecessors, (230135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148295 states to 148295 states and 230135 transitions. [2024-10-11 03:26:06,456 INFO L78 Accepts]: Start accepts. Automaton has 148295 states and 230135 transitions. Word has length 106 [2024-10-11 03:26:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:06,456 INFO L471 AbstractCegarLoop]: Abstraction has 148295 states and 230135 transitions. [2024-10-11 03:26:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 148295 states and 230135 transitions. [2024-10-11 03:26:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:26:06,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:06,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:26:06,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:26:06,463 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:06,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1483911125, now seen corresponding path program 1 times [2024-10-11 03:26:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123179831] [2024-10-11 03:26:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:26:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:06,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123179831] [2024-10-11 03:26:06,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123179831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:06,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:06,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:26:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144812638] [2024-10-11 03:26:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:06,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:26:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:26:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:06,549 INFO L87 Difference]: Start difference. First operand 148295 states and 230135 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:08,518 INFO L93 Difference]: Finished difference Result 240663 states and 374938 transitions. [2024-10-11 03:26:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:26:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-11 03:26:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:08,871 INFO L225 Difference]: With dead ends: 240663 [2024-10-11 03:26:08,872 INFO L226 Difference]: Without dead ends: 154783 [2024-10-11 03:26:08,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:08,959 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 186 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:08,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 662 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:26:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154783 states. [2024-10-11 03:26:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154783 to 103357. [2024-10-11 03:26:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103357 states, 103356 states have (on average 1.546431750454739) internal successors, (159833), 103356 states have internal predecessors, (159833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103357 states to 103357 states and 159833 transitions. [2024-10-11 03:26:11,879 INFO L78 Accepts]: Start accepts. Automaton has 103357 states and 159833 transitions. Word has length 106 [2024-10-11 03:26:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:11,879 INFO L471 AbstractCegarLoop]: Abstraction has 103357 states and 159833 transitions. [2024-10-11 03:26:11,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 103357 states and 159833 transitions. [2024-10-11 03:26:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:26:11,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:11,887 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:26:11,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:26:11,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1302958147, now seen corresponding path program 1 times [2024-10-11 03:26:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308622722] [2024-10-11 03:26:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:26:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308622722] [2024-10-11 03:26:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308622722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393242435] [2024-10-11 03:26:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:11,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:11,945 INFO L87 Difference]: Start difference. First operand 103357 states and 159833 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:14,478 INFO L93 Difference]: Finished difference Result 307656 states and 474768 transitions. [2024-10-11 03:26:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-11 03:26:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:14,901 INFO L225 Difference]: With dead ends: 307656 [2024-10-11 03:26:14,902 INFO L226 Difference]: Without dead ends: 204430 [2024-10-11 03:26:14,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:14,970 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 150 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:14,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 466 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204430 states. [2024-10-11 03:26:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204430 to 204428. [2024-10-11 03:26:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204428 states, 204427 states have (on average 1.5302675282619222) internal successors, (312828), 204427 states have internal predecessors, (312828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204428 states to 204428 states and 312828 transitions. [2024-10-11 03:26:19,664 INFO L78 Accepts]: Start accepts. Automaton has 204428 states and 312828 transitions. Word has length 106 [2024-10-11 03:26:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:19,664 INFO L471 AbstractCegarLoop]: Abstraction has 204428 states and 312828 transitions. [2024-10-11 03:26:19,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 204428 states and 312828 transitions. [2024-10-11 03:26:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:26:20,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:20,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:26:20,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:26:20,066 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1231223721, now seen corresponding path program 1 times [2024-10-11 03:26:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:20,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559403415] [2024-10-11 03:26:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:20,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:26:20,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:20,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559403415] [2024-10-11 03:26:20,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559403415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:20,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:20,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311706985] [2024-10-11 03:26:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:20,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:20,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:20,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:20,172 INFO L87 Difference]: Start difference. First operand 204428 states and 312828 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:22,836 INFO L93 Difference]: Finished difference Result 305494 states and 465810 transitions. [2024-10-11 03:26:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:22,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-11 03:26:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:23,362 INFO L225 Difference]: With dead ends: 305494 [2024-10-11 03:26:23,362 INFO L226 Difference]: Without dead ends: 204530 [2024-10-11 03:26:23,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:23,467 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 124 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:23,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 533 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204530 states. [2024-10-11 03:26:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204530 to 204528. [2024-10-11 03:26:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204528 states, 204527 states have (on average 1.5189681557936117) internal successors, (310670), 204527 states have internal predecessors, (310670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204528 states to 204528 states and 310670 transitions. [2024-10-11 03:26:28,175 INFO L78 Accepts]: Start accepts. Automaton has 204528 states and 310670 transitions. Word has length 107 [2024-10-11 03:26:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 204528 states and 310670 transitions. [2024-10-11 03:26:28,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 204528 states and 310670 transitions. [2024-10-11 03:26:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:26:28,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:28,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:26:28,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:26:28,190 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 83820429, now seen corresponding path program 1 times [2024-10-11 03:26:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539508880] [2024-10-11 03:26:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:26:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:28,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539508880] [2024-10-11 03:26:28,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539508880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:28,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:28,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:26:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78130867] [2024-10-11 03:26:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:28,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:26:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:26:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:28,287 INFO L87 Difference]: Start difference. First operand 204528 states and 310670 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:26:31,004 INFO L93 Difference]: Finished difference Result 274455 states and 415530 transitions. [2024-10-11 03:26:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:26:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-10-11 03:26:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:26:31,360 INFO L225 Difference]: With dead ends: 274455 [2024-10-11 03:26:31,360 INFO L226 Difference]: Without dead ends: 173501 [2024-10-11 03:26:31,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:26:31,465 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 138 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:26:31,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 549 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:26:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173501 states. [2024-10-11 03:26:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173501 to 173499. [2024-10-11 03:26:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173499 states, 173498 states have (on average 1.5074640629863167) internal successors, (261542), 173498 states have internal predecessors, (261542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173499 states to 173499 states and 261542 transitions. [2024-10-11 03:26:35,336 INFO L78 Accepts]: Start accepts. Automaton has 173499 states and 261542 transitions. Word has length 107 [2024-10-11 03:26:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:26:35,337 INFO L471 AbstractCegarLoop]: Abstraction has 173499 states and 261542 transitions. [2024-10-11 03:26:35,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:26:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 173499 states and 261542 transitions. [2024-10-11 03:26:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 03:26:35,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:26:35,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:26:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:26:35,342 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:26:35,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:26:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2056530323, now seen corresponding path program 1 times [2024-10-11 03:26:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:26:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233235866] [2024-10-11 03:26:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:26:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:26:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:26:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:26:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:26:35,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233235866] [2024-10-11 03:26:35,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233235866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:26:35,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:26:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:26:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250005390] [2024-10-11 03:26:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:26:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:26:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:26:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:26:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:26:35,435 INFO L87 Difference]: Start difference. First operand 173499 states and 261542 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)