./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.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 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:11:18,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:11:18,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:11:18,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:11:18,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:11:18,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:11:18,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:11:18,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:11:18,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:11:18,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:11:18,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:11:18,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:11:18,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:11:18,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:11:18,667 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:11:18,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:11:18,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:11:18,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:11:18,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:11:18,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:11:18,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:11:18,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:11:18,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:11:18,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:11:18,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:11:18,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:11:18,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:11:18,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:11:18,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:11:18,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:11:18,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:11:18,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:11:18,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:11:18,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:11:18,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:11:18,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:11:18,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:11:18,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:11:18,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:11:18,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:11:18,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:11:18,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:11:18,681 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 -> 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 [2024-10-14 00:11:18,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:11:18,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:11:18,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:11:18,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:11:18,960 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:11:18,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2024-10-14 00:11:20,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:11:21,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:11:21,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2024-10-14 00:11:22,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d2d2e0d/b1b8aff53e48428c8f033e487db93a44/FLAGa4b844425 [2024-10-14 00:11:22,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d2d2e0d/b1b8aff53e48428c8f033e487db93a44 [2024-10-14 00:11:22,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:11:22,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:11:22,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:11:22,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:11:22,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:11:22,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:11:22" (1/1) ... [2024-10-14 00:11:22,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a717d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:22, skipping insertion in model container [2024-10-14 00:11:22,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:11:22" (1/1) ... [2024-10-14 00:11:22,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:11:23,362 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2024-10-14 00:11:23,393 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2024-10-14 00:11:38,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:11:38,784 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:11:38,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2024-10-14 00:11:38,801 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2024-10-14 00:11:40,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:11:41,919 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:11:41,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41 WrapperNode [2024-10-14 00:11:41,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:11:41,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:11:41,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:11:41,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:11:41,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:42,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:44,532 INFO L138 Inliner]: procedures = 710, calls = 701, calls flagged for inlining = 597, calls inlined = 597, statements flattened = 108770 [2024-10-14 00:11:44,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:11:44,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:11:44,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:11:44,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:11:44,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:44,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:45,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:45,451 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 00:11:45,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:45,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:46,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:46,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:46,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:46,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:47,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:11:47,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:11:47,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:11:47,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:11:47,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (1/1) ... [2024-10-14 00:11:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:11:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:11:47,072 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-10-14 00:11:47,074 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-10-14 00:11:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:11:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:11:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:11:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-10-14 00:11:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-10-14 00:11:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-10-14 00:11:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-10-14 00:11:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:11:47,541 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:11:47,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:12:08,348 INFO L? ?]: Removed 1451 outVars from TransFormulas that were not future-live. [2024-10-14 00:12:08,349 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:12:08,488 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:12:08,489 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 00:12:08,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:08 BoogieIcfgContainer [2024-10-14 00:12:08,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:12:08,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:12:08,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:12:08,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:12:08,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:11:22" (1/3) ... [2024-10-14 00:12:08,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634bc68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:08, skipping insertion in model container [2024-10-14 00:12:08,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:41" (2/3) ... [2024-10-14 00:12:08,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634bc68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:08, skipping insertion in model container [2024-10-14 00:12:08,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:08" (3/3) ... [2024-10-14 00:12:08,503 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13.c [2024-10-14 00:12:08,521 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:12:08,521 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 00:12:08,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:12:08,706 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;@2b5bf2f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:12:08,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 00:12:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 3528 states, 3423 states have (on average 1.8258837277242186) internal successors, (6250), 3425 states have internal predecessors, (6250), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 00:12:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 00:12:08,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:08,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:08,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:08,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 990205398, now seen corresponding path program 1 times [2024-10-14 00:12:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114337217] [2024-10-14 00:12:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:09,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114337217] [2024-10-14 00:12:09,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114337217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:09,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404499205] [2024-10-14 00:12:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:09,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:12:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:12:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:12:09,502 INFO L87 Difference]: Start difference. First operand has 3528 states, 3423 states have (on average 1.8258837277242186) internal successors, (6250), 3425 states have internal predecessors, (6250), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:18,827 INFO L93 Difference]: Finished difference Result 9545 states and 17562 transitions. [2024-10-14 00:12:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:12:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 00:12:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:18,884 INFO L225 Difference]: With dead ends: 9545 [2024-10-14 00:12:18,884 INFO L226 Difference]: Without dead ends: 6012 [2024-10-14 00:12:18,899 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-10-14 00:12:18,903 INFO L432 NwaCegarLoop]: 6276 mSDtfsCounter, 4893 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 7375 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4893 SdHoareTripleChecker+Valid, 9589 SdHoareTripleChecker+Invalid, 7988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 7375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:18,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4893 Valid, 9589 Invalid, 7988 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [613 Valid, 7375 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-10-14 00:12:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2024-10-14 00:12:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5242. [2024-10-14 00:12:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 5140 states have (on average 1.7846303501945526) internal successors, (9173), 5239 states have internal predecessors, (9173), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 9273 transitions. [2024-10-14 00:12:19,152 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 9273 transitions. Word has length 12 [2024-10-14 00:12:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:19,152 INFO L471 AbstractCegarLoop]: Abstraction has 5242 states and 9273 transitions. [2024-10-14 00:12:19,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 9273 transitions. [2024-10-14 00:12:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 00:12:19,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:19,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:19,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:12:19,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1807079401, now seen corresponding path program 1 times [2024-10-14 00:12:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045112640] [2024-10-14 00:12:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:19,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045112640] [2024-10-14 00:12:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045112640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:19,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111824560] [2024-10-14 00:12:19,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:12:19,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:12:19,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:12:19,468 INFO L87 Difference]: Start difference. First operand 5242 states and 9273 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:28,228 INFO L93 Difference]: Finished difference Result 11844 states and 20867 transitions. [2024-10-14 00:12:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:12:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 00:12:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:28,261 INFO L225 Difference]: With dead ends: 11844 [2024-10-14 00:12:28,261 INFO L226 Difference]: Without dead ends: 6603 [2024-10-14 00:12:28,272 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-10-14 00:12:28,273 INFO L432 NwaCegarLoop]: 6512 mSDtfsCounter, 1227 mSDsluCounter, 4011 mSDsCounter, 0 mSdLazyCounter, 10164 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 10523 SdHoareTripleChecker+Invalid, 10418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 10164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:28,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 10523 Invalid, 10418 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [254 Valid, 10164 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-10-14 00:12:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2024-10-14 00:12:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 6110. [2024-10-14 00:12:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6110 states, 6008 states have (on average 1.7496671105193076) internal successors, (10512), 6107 states have internal predecessors, (10512), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 10612 transitions. [2024-10-14 00:12:28,435 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 10612 transitions. Word has length 21 [2024-10-14 00:12:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:28,435 INFO L471 AbstractCegarLoop]: Abstraction has 6110 states and 10612 transitions. [2024-10-14 00:12:28,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 10612 transitions. [2024-10-14 00:12:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 00:12:28,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:28,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:28,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:12:28,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:28,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 335599713, now seen corresponding path program 1 times [2024-10-14 00:12:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672614522] [2024-10-14 00:12:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672614522] [2024-10-14 00:12:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672614522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:28,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:12:28,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114216692] [2024-10-14 00:12:28,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:28,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:28,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:28,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:28,581 INFO L87 Difference]: Start difference. First operand 6110 states and 10612 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:28,913 INFO L93 Difference]: Finished difference Result 17795 states and 30929 transitions. [2024-10-14 00:12:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 00:12:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:28,961 INFO L225 Difference]: With dead ends: 17795 [2024-10-14 00:12:28,962 INFO L226 Difference]: Without dead ends: 11686 [2024-10-14 00:12:28,977 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-10-14 00:12:28,978 INFO L432 NwaCegarLoop]: 6283 mSDtfsCounter, 6150 mSDsluCounter, 6029 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6150 SdHoareTripleChecker+Valid, 12312 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:28,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6150 Valid, 12312 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 00:12:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11686 states. [2024-10-14 00:12:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11686 to 11587. [2024-10-14 00:12:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11587 states, 11485 states have (on average 1.7508053983456682) internal successors, (20108), 11584 states have internal predecessors, (20108), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11587 states to 11587 states and 20208 transitions. [2024-10-14 00:12:29,233 INFO L78 Accepts]: Start accepts. Automaton has 11587 states and 20208 transitions. Word has length 31 [2024-10-14 00:12:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:29,233 INFO L471 AbstractCegarLoop]: Abstraction has 11587 states and 20208 transitions. [2024-10-14 00:12:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11587 states and 20208 transitions. [2024-10-14 00:12:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 00:12:29,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:29,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:29,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:12:29,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1588360543, now seen corresponding path program 1 times [2024-10-14 00:12:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602884376] [2024-10-14 00:12:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:29,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602884376] [2024-10-14 00:12:29,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602884376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:29,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:29,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894881289] [2024-10-14 00:12:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:29,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:29,346 INFO L87 Difference]: Start difference. First operand 11587 states and 20208 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:30,158 INFO L93 Difference]: Finished difference Result 34078 states and 59451 transitions. [2024-10-14 00:12:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 00:12:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:30,213 INFO L225 Difference]: With dead ends: 34078 [2024-10-14 00:12:30,214 INFO L226 Difference]: Without dead ends: 22492 [2024-10-14 00:12:30,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:30,241 INFO L432 NwaCegarLoop]: 6755 mSDtfsCounter, 5696 mSDsluCounter, 5870 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 12625 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:30,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 12625 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 00:12:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22492 states. [2024-10-14 00:12:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22492 to 22379. [2024-10-14 00:12:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22379 states, 22277 states have (on average 1.749517439511604) internal successors, (38974), 22376 states have internal predecessors, (38974), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22379 states to 22379 states and 39074 transitions. [2024-10-14 00:12:30,773 INFO L78 Accepts]: Start accepts. Automaton has 22379 states and 39074 transitions. Word has length 31 [2024-10-14 00:12:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:30,774 INFO L471 AbstractCegarLoop]: Abstraction has 22379 states and 39074 transitions. [2024-10-14 00:12:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 22379 states and 39074 transitions. [2024-10-14 00:12:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 00:12:30,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:30,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:30,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:12:30,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:30,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1995237496, now seen corresponding path program 1 times [2024-10-14 00:12:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984082552] [2024-10-14 00:12:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:30,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984082552] [2024-10-14 00:12:30,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984082552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:30,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:30,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:12:30,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968999148] [2024-10-14 00:12:30,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:30,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:30,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:30,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:30,934 INFO L87 Difference]: Start difference. First operand 22379 states and 39074 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:12:31,389 INFO L93 Difference]: Finished difference Result 66926 states and 116839 transitions. [2024-10-14 00:12:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:12:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 00:12:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:12:31,520 INFO L225 Difference]: With dead ends: 66926 [2024-10-14 00:12:31,520 INFO L226 Difference]: Without dead ends: 44548 [2024-10-14 00:12:31,569 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-10-14 00:12:31,570 INFO L432 NwaCegarLoop]: 6269 mSDtfsCounter, 6152 mSDsluCounter, 6203 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6152 SdHoareTripleChecker+Valid, 12472 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:12:31,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6152 Valid, 12472 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:12:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44548 states. [2024-10-14 00:12:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44548 to 44445. [2024-10-14 00:12:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44445 states, 44343 states have (on average 1.7485736192860204) internal successors, (77537), 44442 states have internal predecessors, (77537), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44445 states to 44445 states and 77637 transitions. [2024-10-14 00:12:32,234 INFO L78 Accepts]: Start accepts. Automaton has 44445 states and 77637 transitions. Word has length 32 [2024-10-14 00:12:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:12:32,234 INFO L471 AbstractCegarLoop]: Abstraction has 44445 states and 77637 transitions. [2024-10-14 00:12:32,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:12:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44445 states and 77637 transitions. [2024-10-14 00:12:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 00:12:32,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:12:32,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:12:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:12:32,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:12:32,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:12:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1723514362, now seen corresponding path program 1 times [2024-10-14 00:12:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:12:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310853869] [2024-10-14 00:12:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:12:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:12:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:12:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:12:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:12:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310853869] [2024-10-14 00:12:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310853869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:12:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:12:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:12:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6701347] [2024-10-14 00:12:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:12:32,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:12:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:12:32,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:12:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:12:32,386 INFO L87 Difference]: Start difference. First operand 44445 states and 77637 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)