./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label35.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:55:04,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:55:04,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:55:04,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:55:04,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:55:04,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:55:04,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:55:04,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:55:04,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:55:04,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:55:04,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:55:04,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:55:04,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:55:04,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:55:04,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:55:04,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:55:04,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:55:04,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:55:04,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:55:04,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:55:04,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:55:04,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:55:04,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:55:04,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:55:04,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:55:04,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:55:04,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:55:04,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:55:04,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:55:04,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:55:04,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:55:04,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:55:04,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:55:04,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:55:04,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:55:04,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:55:04,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:55:04,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:55:04,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:55:04,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:55:04,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:55:04,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:55:04,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2024-11-16 03:55:05,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:55:05,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:55:05,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:55:05,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:55:05,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:55:05,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-11-16 03:55:06,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:55:07,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:55:07,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-11-16 03:55:07,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c279048/7e8e56b7a92f454294ca6cefc4a655ab/FLAGc75d735ac [2024-11-16 03:55:07,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c279048/7e8e56b7a92f454294ca6cefc4a655ab [2024-11-16 03:55:07,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:55:07,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:55:07,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:55:07,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:55:07,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:55:07,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:55:07" (1/1) ... [2024-11-16 03:55:07,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f379eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:07, skipping insertion in model container [2024-11-16 03:55:07,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:55:07" (1/1) ... [2024-11-16 03:55:07,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:55:07,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c[1310,1323] [2024-11-16 03:55:08,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:55:08,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:55:08,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c[1310,1323] [2024-11-16 03:55:08,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:55:08,977 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:55:08,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08 WrapperNode [2024-11-16 03:55:08,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:55:08,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:55:08,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:55:08,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:55:08,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,398 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-16 03:55:09,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:55:09,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:55:09,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:55:09,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:55:09,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,611 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-11-16 03:55:09,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:55:09,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:55:09,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:55:09,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:55:09,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (1/1) ... [2024-11-16 03:55:09,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:55:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:55:09,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:55:09,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:55:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:55:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:55:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:55:10,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:55:10,092 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:55:10,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:55:14,448 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-16 03:55:14,449 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-16 03:55:14,449 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-16 03:55:14,586 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-16 03:55:14,586 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:55:14,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:55:14,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:55:14,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:55:14 BoogieIcfgContainer [2024-11-16 03:55:14,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:55:14,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:55:14,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:55:14,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:55:14,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:55:07" (1/3) ... [2024-11-16 03:55:14,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389c97a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:55:14, skipping insertion in model container [2024-11-16 03:55:14,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:08" (2/3) ... [2024-11-16 03:55:14,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389c97a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:55:14, skipping insertion in model container [2024-11-16 03:55:14,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:55:14" (3/3) ... [2024-11-16 03:55:14,637 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2024-11-16 03:55:14,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:55:14,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:55:14,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:55:14,768 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;@2c20d25c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:55:14,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:55:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 1.9145299145299146) internal successors, (1568), 820 states have internal predecessors, (1568), 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-11-16 03:55:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 03:55:14,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:14,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:55:14,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1881170674, now seen corresponding path program 1 times [2024-11-16 03:55:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386317927] [2024-11-16 03:55:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:14,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386317927] [2024-11-16 03:55:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386317927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:55:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860344038] [2024-11-16 03:55:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:15,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:15,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:15,076 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 1.9145299145299146) internal successors, (1568), 820 states have internal predecessors, (1568), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-11-16 03:55:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:18,499 INFO L93 Difference]: Finished difference Result 2394 states and 4635 transitions. [2024-11-16 03:55:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-16 03:55:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:18,525 INFO L225 Difference]: With dead ends: 2394 [2024-11-16 03:55:18,525 INFO L226 Difference]: Without dead ends: 1509 [2024-11-16 03:55:18,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:55:18,534 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 827 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:18,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 485 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-16 03:55:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-16 03:55:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-16 03:55:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.6372679045092837) internal successors, (2469), 1508 states have internal predecessors, (2469), 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-11-16 03:55:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2469 transitions. [2024-11-16 03:55:18,665 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2469 transitions. Word has length 9 [2024-11-16 03:55:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2469 transitions. [2024-11-16 03:55:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-11-16 03:55:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2469 transitions. [2024-11-16 03:55:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 03:55:18,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:18,668 INFO L215 NwaCegarLoop]: trace histogram [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-11-16 03:55:18,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:55:18,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:18,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1563341255, now seen corresponding path program 1 times [2024-11-16 03:55:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:18,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667994647] [2024-11-16 03:55:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667994647] [2024-11-16 03:55:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667994647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:18,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:18,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56171403] [2024-11-16 03:55:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:18,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:18,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:18,948 INFO L87 Difference]: Start difference. First operand 1509 states and 2469 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-11-16 03:55:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:22,025 INFO L93 Difference]: Finished difference Result 4520 states and 7401 transitions. [2024-11-16 03:55:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:22,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2024-11-16 03:55:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:22,037 INFO L225 Difference]: With dead ends: 4520 [2024-11-16 03:55:22,037 INFO L226 Difference]: Without dead ends: 3013 [2024-11-16 03:55:22,042 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-11-16 03:55:22,043 INFO L432 NwaCegarLoop]: 1386 mSDtfsCounter, 772 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:22,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1396 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-16 03:55:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2024-11-16 03:55:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2024-11-16 03:55:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.3628818061088976) internal successors, (4105), 3012 states have internal predecessors, (4105), 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-11-16 03:55:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4105 transitions. [2024-11-16 03:55:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4105 transitions. Word has length 81 [2024-11-16 03:55:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:22,104 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 4105 transitions. [2024-11-16 03:55:22,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-11-16 03:55:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4105 transitions. [2024-11-16 03:55:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-16 03:55:22,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:22,109 INFO L215 NwaCegarLoop]: trace histogram [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-11-16 03:55:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:55:22,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:22,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash 619386674, now seen corresponding path program 1 times [2024-11-16 03:55:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:22,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394568726] [2024-11-16 03:55:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:22,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:22,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394568726] [2024-11-16 03:55:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394568726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:55:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169874085] [2024-11-16 03:55:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:22,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:22,297 INFO L87 Difference]: Start difference. First operand 3013 states and 4105 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-11-16 03:55:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:25,148 INFO L93 Difference]: Finished difference Result 7528 states and 10673 transitions. [2024-11-16 03:55:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 84 [2024-11-16 03:55:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:25,167 INFO L225 Difference]: With dead ends: 7528 [2024-11-16 03:55:25,167 INFO L226 Difference]: Without dead ends: 4517 [2024-11-16 03:55:25,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:55:25,174 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 749 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:25,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 523 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 03:55:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2024-11-16 03:55:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4517. [2024-11-16 03:55:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4516 states have (on average 1.324623560673162) internal successors, (5982), 4516 states have internal predecessors, (5982), 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-11-16 03:55:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 5982 transitions. [2024-11-16 03:55:25,272 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 5982 transitions. Word has length 84 [2024-11-16 03:55:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:25,273 INFO L471 AbstractCegarLoop]: Abstraction has 4517 states and 5982 transitions. [2024-11-16 03:55:25,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-11-16 03:55:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 5982 transitions. [2024-11-16 03:55:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 03:55:25,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:25,278 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:55:25,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:55:25,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 938686858, now seen corresponding path program 1 times [2024-11-16 03:55:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:25,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982798993] [2024-11-16 03:55:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:25,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982798993] [2024-11-16 03:55:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982798993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:25,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:55:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475160868] [2024-11-16 03:55:25,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:25,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:25,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:25,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:25,496 INFO L87 Difference]: Start difference. First operand 4517 states and 5982 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-11-16 03:55:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:28,275 INFO L93 Difference]: Finished difference Result 13547 states and 17942 transitions. [2024-11-16 03:55:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:28,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2024-11-16 03:55:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:28,308 INFO L225 Difference]: With dead ends: 13547 [2024-11-16 03:55:28,309 INFO L226 Difference]: Without dead ends: 9032 [2024-11-16 03:55:28,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:55:28,316 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 717 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:28,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 622 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 03:55:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2024-11-16 03:55:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 9029. [2024-11-16 03:55:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9029 states, 9028 states have (on average 1.2164377492246345) internal successors, (10982), 9028 states have internal predecessors, (10982), 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-11-16 03:55:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9029 states to 9029 states and 10982 transitions. [2024-11-16 03:55:28,474 INFO L78 Accepts]: Start accepts. Automaton has 9029 states and 10982 transitions. Word has length 95 [2024-11-16 03:55:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:28,475 INFO L471 AbstractCegarLoop]: Abstraction has 9029 states and 10982 transitions. [2024-11-16 03:55:28,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-11-16 03:55:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9029 states and 10982 transitions. [2024-11-16 03:55:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 03:55:28,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:28,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:55:28,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:28,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2076963310, now seen corresponding path program 1 times [2024-11-16 03:55:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:28,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142893262] [2024-11-16 03:55:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142893262] [2024-11-16 03:55:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142893262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:28,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:28,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476213719] [2024-11-16 03:55:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:28,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:55:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:55:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:55:28,890 INFO L87 Difference]: Start difference. First operand 9029 states and 10982 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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-11-16 03:55:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:31,670 INFO L93 Difference]: Finished difference Result 22609 states and 27002 transitions. [2024-11-16 03:55:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:55:31,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2024-11-16 03:55:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:31,704 INFO L225 Difference]: With dead ends: 22609 [2024-11-16 03:55:31,704 INFO L226 Difference]: Without dead ends: 12040 [2024-11-16 03:55:31,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-16 03:55:31,714 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 706 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:31,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 710 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 03:55:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12040 states. [2024-11-16 03:55:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12040 to 12037. [2024-11-16 03:55:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12037 states, 12036 states have (on average 1.1624293785310735) internal successors, (13991), 12036 states have internal predecessors, (13991), 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-11-16 03:55:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12037 states to 12037 states and 13991 transitions. [2024-11-16 03:55:31,905 INFO L78 Accepts]: Start accepts. Automaton has 12037 states and 13991 transitions. Word has length 150 [2024-11-16 03:55:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:31,906 INFO L471 AbstractCegarLoop]: Abstraction has 12037 states and 13991 transitions. [2024-11-16 03:55:31,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 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-11-16 03:55:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 12037 states and 13991 transitions. [2024-11-16 03:55:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-16 03:55:31,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:31,908 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:55:31,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:55:31,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:31,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash -539254943, now seen corresponding path program 1 times [2024-11-16 03:55:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537089296] [2024-11-16 03:55:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:31,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537089296] [2024-11-16 03:55:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537089296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:32,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:55:32,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932800854] [2024-11-16 03:55:32,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 03:55:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 03:55:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:55:32,472 INFO L87 Difference]: Start difference. First operand 12037 states and 13991 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 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-11-16 03:55:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:36,923 INFO L93 Difference]: Finished difference Result 30088 states and 34585 transitions. [2024-11-16 03:55:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:55:36,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 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 154 [2024-11-16 03:55:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:36,968 INFO L225 Difference]: With dead ends: 30088 [2024-11-16 03:55:36,969 INFO L226 Difference]: Without dead ends: 18805 [2024-11-16 03:55:36,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:55:36,983 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 2813 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5203 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 5356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:36,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 650 Invalid, 5356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5203 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-16 03:55:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18805 states. [2024-11-16 03:55:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18805 to 18053. [2024-11-16 03:55:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18053 states, 18052 states have (on average 1.1234766230888544) internal successors, (20281), 18052 states have internal predecessors, (20281), 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-11-16 03:55:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18053 states to 18053 states and 20281 transitions. [2024-11-16 03:55:37,359 INFO L78 Accepts]: Start accepts. Automaton has 18053 states and 20281 transitions. Word has length 154 [2024-11-16 03:55:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:37,359 INFO L471 AbstractCegarLoop]: Abstraction has 18053 states and 20281 transitions. [2024-11-16 03:55:37,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 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-11-16 03:55:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18053 states and 20281 transitions. [2024-11-16 03:55:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-16 03:55:37,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:37,363 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:37,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:55:37,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash -248716242, now seen corresponding path program 1 times [2024-11-16 03:55:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303694983] [2024-11-16 03:55:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:55:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:37,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303694983] [2024-11-16 03:55:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303694983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:37,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:37,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133055211] [2024-11-16 03:55:37,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:37,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:37,655 INFO L87 Difference]: Start difference. First operand 18053 states and 20281 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-11-16 03:55:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:40,695 INFO L93 Difference]: Finished difference Result 51144 states and 57738 transitions. [2024-11-16 03:55:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 237 [2024-11-16 03:55:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:40,750 INFO L225 Difference]: With dead ends: 51144 [2024-11-16 03:55:40,751 INFO L226 Difference]: Without dead ends: 33093 [2024-11-16 03:55:40,773 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-11-16 03:55:40,774 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 668 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:40,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1350 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 03:55:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33093 states. [2024-11-16 03:55:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33093 to 30085. [2024-11-16 03:55:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30085 states, 30084 states have (on average 1.123886451269778) internal successors, (33811), 30084 states have internal predecessors, (33811), 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-11-16 03:55:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30085 states to 30085 states and 33811 transitions. [2024-11-16 03:55:41,381 INFO L78 Accepts]: Start accepts. Automaton has 30085 states and 33811 transitions. Word has length 237 [2024-11-16 03:55:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 30085 states and 33811 transitions. [2024-11-16 03:55:41,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-11-16 03:55:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 30085 states and 33811 transitions. [2024-11-16 03:55:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-16 03:55:41,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:41,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:55:41,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1412270968, now seen corresponding path program 1 times [2024-11-16 03:55:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304869851] [2024-11-16 03:55:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-16 03:55:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304869851] [2024-11-16 03:55:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304869851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:41,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:41,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47602018] [2024-11-16 03:55:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:41,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:41,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:41,841 INFO L87 Difference]: Start difference. First operand 30085 states and 33811 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-11-16 03:55:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:44,385 INFO L93 Difference]: Finished difference Result 70696 states and 80454 transitions. [2024-11-16 03:55:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 241 [2024-11-16 03:55:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:44,449 INFO L225 Difference]: With dead ends: 70696 [2024-11-16 03:55:44,450 INFO L226 Difference]: Without dead ends: 40613 [2024-11-16 03:55:44,475 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-11-16 03:55:44,476 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 768 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:44,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1226 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-16 03:55:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40613 states. [2024-11-16 03:55:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40613 to 40613. [2024-11-16 03:55:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40613 states, 40612 states have (on average 1.1095735250664829) internal successors, (45062), 40612 states have internal predecessors, (45062), 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-11-16 03:55:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40613 states to 40613 states and 45062 transitions. [2024-11-16 03:55:45,072 INFO L78 Accepts]: Start accepts. Automaton has 40613 states and 45062 transitions. Word has length 241 [2024-11-16 03:55:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:45,073 INFO L471 AbstractCegarLoop]: Abstraction has 40613 states and 45062 transitions. [2024-11-16 03:55:45,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-11-16 03:55:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 40613 states and 45062 transitions. [2024-11-16 03:55:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-16 03:55:45,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:45,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:45,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:55:45,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash 780009021, now seen corresponding path program 1 times [2024-11-16 03:55:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:45,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352505840] [2024-11-16 03:55:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-16 03:55:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352505840] [2024-11-16 03:55:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352505840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:45,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:45,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001119615] [2024-11-16 03:55:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:45,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:45,452 INFO L87 Difference]: Start difference. First operand 40613 states and 45062 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-11-16 03:55:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:48,379 INFO L93 Difference]: Finished difference Result 92504 states and 103567 transitions. [2024-11-16 03:55:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 296 [2024-11-16 03:55:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:48,458 INFO L225 Difference]: With dead ends: 92504 [2024-11-16 03:55:48,458 INFO L226 Difference]: Without dead ends: 51893 [2024-11-16 03:55:48,491 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-11-16 03:55:48,492 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 763 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:48,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 317 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 03:55:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51893 states. [2024-11-16 03:55:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51893 to 48885. [2024-11-16 03:55:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48885 states, 48884 states have (on average 1.12816054332706) internal successors, (55149), 48884 states have internal predecessors, (55149), 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-11-16 03:55:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48885 states to 48885 states and 55149 transitions. [2024-11-16 03:55:49,061 INFO L78 Accepts]: Start accepts. Automaton has 48885 states and 55149 transitions. Word has length 296 [2024-11-16 03:55:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:49,062 INFO L471 AbstractCegarLoop]: Abstraction has 48885 states and 55149 transitions. [2024-11-16 03:55:49,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-11-16 03:55:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 48885 states and 55149 transitions. [2024-11-16 03:55:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-16 03:55:49,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:49,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-16 03:55:49,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:55:49,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:49,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1118065795, now seen corresponding path program 1 times [2024-11-16 03:55:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591089201] [2024-11-16 03:55:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-16 03:55:49,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591089201] [2024-11-16 03:55:49,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591089201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:49,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:49,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:49,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003111874] [2024-11-16 03:55:49,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:49,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:49,569 INFO L87 Difference]: Start difference. First operand 48885 states and 55149 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-11-16 03:55:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:52,527 INFO L93 Difference]: Finished difference Result 114312 states and 130838 transitions. [2024-11-16 03:55:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:52,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 309 [2024-11-16 03:55:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:52,609 INFO L225 Difference]: With dead ends: 114312 [2024-11-16 03:55:52,609 INFO L226 Difference]: Without dead ends: 65429 [2024-11-16 03:55:52,645 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-11-16 03:55:52,646 INFO L432 NwaCegarLoop]: 1188 mSDtfsCounter, 774 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:52,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1196 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 03:55:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65429 states. [2024-11-16 03:55:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65429 to 63925. [2024-11-16 03:55:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63925 states, 63924 states have (on average 1.1211282147550217) internal successors, (71667), 63924 states have internal predecessors, (71667), 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-11-16 03:55:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63925 states to 63925 states and 71667 transitions. [2024-11-16 03:55:53,524 INFO L78 Accepts]: Start accepts. Automaton has 63925 states and 71667 transitions. Word has length 309 [2024-11-16 03:55:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:53,524 INFO L471 AbstractCegarLoop]: Abstraction has 63925 states and 71667 transitions. [2024-11-16 03:55:53,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-11-16 03:55:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 63925 states and 71667 transitions. [2024-11-16 03:55:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-16 03:55:53,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:53,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:53,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:55:53,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:53,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 441100964, now seen corresponding path program 1 times [2024-11-16 03:55:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:53,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151799250] [2024-11-16 03:55:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-16 03:55:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151799250] [2024-11-16 03:55:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151799250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:55:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183103153] [2024-11-16 03:55:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:53,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:53,996 INFO L87 Difference]: Start difference. First operand 63925 states and 71667 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-11-16 03:55:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:55:56,939 INFO L93 Difference]: Finished difference Result 169963 states and 192057 transitions. [2024-11-16 03:55:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:55:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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 335 [2024-11-16 03:55:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:55:57,050 INFO L225 Difference]: With dead ends: 169963 [2024-11-16 03:55:57,050 INFO L226 Difference]: Without dead ends: 97768 [2024-11-16 03:55:57,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 03:55:57,088 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 844 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:55:57,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 319 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 03:55:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97768 states. [2024-11-16 03:55:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97768 to 84229. [2024-11-16 03:55:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84229 states, 84228 states have (on average 1.1028399107185258) internal successors, (92890), 84228 states have internal predecessors, (92890), 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-11-16 03:55:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84229 states to 84229 states and 92890 transitions. [2024-11-16 03:55:58,307 INFO L78 Accepts]: Start accepts. Automaton has 84229 states and 92890 transitions. Word has length 335 [2024-11-16 03:55:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:55:58,308 INFO L471 AbstractCegarLoop]: Abstraction has 84229 states and 92890 transitions. [2024-11-16 03:55:58,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-11-16 03:55:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 84229 states and 92890 transitions. [2024-11-16 03:55:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-16 03:55:58,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:55:58,314 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:55:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:55:58,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:55:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:55:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1649787190, now seen corresponding path program 1 times [2024-11-16 03:55:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:55:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967695822] [2024-11-16 03:55:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:55:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:55:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:55:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-16 03:55:58,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:55:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967695822] [2024-11-16 03:55:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967695822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:55:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:55:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:55:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057311588] [2024-11-16 03:55:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:55:58,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:55:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:55:58,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:55:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:55:58,891 INFO L87 Difference]: Start difference. First operand 84229 states and 92890 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-11-16 03:56:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:56:01,755 INFO L93 Difference]: Finished difference Result 170712 states and 188080 transitions. [2024-11-16 03:56:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:56:01,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 410 [2024-11-16 03:56:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:56:01,854 INFO L225 Difference]: With dead ends: 170712 [2024-11-16 03:56:01,854 INFO L226 Difference]: Without dead ends: 83477 [2024-11-16 03:56:01,886 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-11-16 03:56:01,887 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 739 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:56:01,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1214 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 03:56:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83477 states. [2024-11-16 03:56:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83477 to 72949. [2024-11-16 03:56:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72949 states, 72948 states have (on average 1.0671437188134014) internal successors, (77846), 72948 states have internal predecessors, (77846), 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-11-16 03:56:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72949 states to 72949 states and 77846 transitions. [2024-11-16 03:56:02,794 INFO L78 Accepts]: Start accepts. Automaton has 72949 states and 77846 transitions. Word has length 410 [2024-11-16 03:56:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:56:02,795 INFO L471 AbstractCegarLoop]: Abstraction has 72949 states and 77846 transitions. [2024-11-16 03:56:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-11-16 03:56:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 72949 states and 77846 transitions. [2024-11-16 03:56:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-16 03:56:02,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:56:02,803 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:56:02,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:56:02,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:56:02,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:56:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1159258831, now seen corresponding path program 1 times [2024-11-16 03:56:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:56:02,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972143678] [2024-11-16 03:56:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:56:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:56:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:56:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:56:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:56:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972143678] [2024-11-16 03:56:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972143678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:56:03,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:56:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:56:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677311823] [2024-11-16 03:56:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:56:03,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:56:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:56:03,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:56:03,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:56:03,522 INFO L87 Difference]: Start difference. First operand 72949 states and 77846 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-11-16 03:56:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:56:06,520 INFO L93 Difference]: Finished difference Result 181240 states and 194454 transitions. [2024-11-16 03:56:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:56:06,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 426 [2024-11-16 03:56:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:56:06,637 INFO L225 Difference]: With dead ends: 181240 [2024-11-16 03:56:06,637 INFO L226 Difference]: Without dead ends: 109045 [2024-11-16 03:56:06,679 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-11-16 03:56:06,679 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 717 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:56:06,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 540 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 03:56:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109045 states. [2024-11-16 03:56:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109045 to 103029. [2024-11-16 03:56:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103029 states, 103028 states have (on average 1.0677388671040882) internal successors, (110007), 103028 states have internal predecessors, (110007), 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-11-16 03:56:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103029 states to 103029 states and 110007 transitions. [2024-11-16 03:56:08,346 INFO L78 Accepts]: Start accepts. Automaton has 103029 states and 110007 transitions. Word has length 426 [2024-11-16 03:56:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:56:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 103029 states and 110007 transitions. [2024-11-16 03:56:08,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-11-16 03:56:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 103029 states and 110007 transitions. [2024-11-16 03:56:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-16 03:56:08,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:56:08,351 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:56:08,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:56:08,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:56:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:56:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash -629229017, now seen corresponding path program 1 times [2024-11-16 03:56:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:56:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724738253] [2024-11-16 03:56:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:56:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:56:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:56:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:56:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:56:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724738253] [2024-11-16 03:56:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724738253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:56:09,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:56:09,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:56:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710326253] [2024-11-16 03:56:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:56:09,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:56:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:56:09,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:56:09,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:56:09,110 INFO L87 Difference]: Start difference. First operand 103029 states and 110007 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-11-16 03:56:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:56:12,199 INFO L93 Difference]: Finished difference Result 237640 states and 254787 transitions. [2024-11-16 03:56:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:56:12,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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 430 [2024-11-16 03:56:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:56:12,357 INFO L225 Difference]: With dead ends: 237640 [2024-11-16 03:56:12,357 INFO L226 Difference]: Without dead ends: 135365 [2024-11-16 03:56:12,396 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-11-16 03:56:12,397 INFO L432 NwaCegarLoop]: 1265 mSDtfsCounter, 696 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:56:12,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1275 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-16 03:56:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135365 states. [2024-11-16 03:56:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135365 to 125589. [2024-11-16 03:56:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125589 states, 125588 states have (on average 1.0627448482339077) internal successors, (133468), 125588 states have internal predecessors, (133468), 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-11-16 03:56:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125589 states to 125589 states and 133468 transitions. [2024-11-16 03:56:14,481 INFO L78 Accepts]: Start accepts. Automaton has 125589 states and 133468 transitions. Word has length 430 [2024-11-16 03:56:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:56:14,482 INFO L471 AbstractCegarLoop]: Abstraction has 125589 states and 133468 transitions. [2024-11-16 03:56:14,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-11-16 03:56:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 125589 states and 133468 transitions. [2024-11-16 03:56:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-16 03:56:14,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:56:14,487 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:56:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:56:14,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:56:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:56:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1066742279, now seen corresponding path program 1 times [2024-11-16 03:56:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:56:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480756586] [2024-11-16 03:56:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:56:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:56:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:56:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-16 03:56:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:56:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480756586] [2024-11-16 03:56:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480756586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:56:14,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:56:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:56:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893138918] [2024-11-16 03:56:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:56:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:56:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:56:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:56:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:56:14,792 INFO L87 Difference]: Start difference. First operand 125589 states and 133468 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-11-16 03:56:17,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:56:17,819 INFO L93 Difference]: Finished difference Result 249672 states and 265394 transitions. [2024-11-16 03:56:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:56:17,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 433 [2024-11-16 03:56:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:56:17,969 INFO L225 Difference]: With dead ends: 249672 [2024-11-16 03:56:17,970 INFO L226 Difference]: Without dead ends: 124837 [2024-11-16 03:56:18,039 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-11-16 03:56:18,040 INFO L432 NwaCegarLoop]: 1144 mSDtfsCounter, 644 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:56:18,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1154 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 03:56:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124837 states. [2024-11-16 03:56:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124837 to 123333. [2024-11-16 03:56:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123333 states, 123332 states have (on average 1.0413031492232347) internal successors, (128426), 123332 states have internal predecessors, (128426), 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-11-16 03:56:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123333 states to 123333 states and 128426 transitions. [2024-11-16 03:56:19,898 INFO L78 Accepts]: Start accepts. Automaton has 123333 states and 128426 transitions. Word has length 433 [2024-11-16 03:56:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:56:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 123333 states and 128426 transitions. [2024-11-16 03:56:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-11-16 03:56:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 123333 states and 128426 transitions. [2024-11-16 03:56:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2024-11-16 03:56:19,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:56:19,914 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 03:56:19,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:56:19,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:56:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:56:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 393367930, now seen corresponding path program 1 times [2024-11-16 03:56:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:56:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360289424] [2024-11-16 03:56:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:56:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:56:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:56:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-16 03:56:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:56:21,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360289424] [2024-11-16 03:56:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360289424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:56:21,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:56:21,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:56:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322543442] [2024-11-16 03:56:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:56:21,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:56:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:56:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:56:21,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:56:21,084 INFO L87 Difference]: Start difference. First operand 123333 states and 128426 transitions. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 3 states have internal predecessors, (318), 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)