./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i -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 f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:53:39,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:53:39,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:53:39,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:53:39,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:53:39,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:53:39,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:53:39,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:53:39,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:53:39,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:53:39,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:53:39,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:53:39,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:53:39,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:53:39,478 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:53:39,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:53:39,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:53:39,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:53:39,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:53:39,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:53:39,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:53:39,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:53:39,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:53:39,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:53:39,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:53:39,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:53:39,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:53:39,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:53:39,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:53:39,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:53:39,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:53:39,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:53:39,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:53:39,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:53:39,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:53:39,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:53:39,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:53:39,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:53:39,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:53:39,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:53:39,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:53:39,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:53:39,487 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 -> f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b [2024-10-24 09:53:39,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:53:39,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:53:39,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:53:39,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:53:39,772 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:53:39,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-10-24 09:53:41,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:53:41,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:53:41,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-10-24 09:53:41,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cb4c730/0b9219e8a93749c9be91a5c1baf8d0e6/FLAGde070eb8b [2024-10-24 09:53:41,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cb4c730/0b9219e8a93749c9be91a5c1baf8d0e6 [2024-10-24 09:53:41,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:53:41,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:53:41,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:53:41,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:53:41,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:53:41,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:53:41" (1/1) ... [2024-10-24 09:53:41,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e99da0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:41, skipping insertion in model container [2024-10-24 09:53:41,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:53:41" (1/1) ... [2024-10-24 09:53:41,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:53:42,007 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/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i[915,928] [2024-10-24 09:53:42,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:53:42,074 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:53:42,084 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/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i[915,928] [2024-10-24 09:53:42,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:53:42,126 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:53:42,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42 WrapperNode [2024-10-24 09:53:42,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:53:42,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:53:42,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:53:42,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:53:42,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,194 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-24 09:53:42,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:53:42,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:53:42,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:53:42,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:53:42,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,234 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-24 09:53:42,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:53:42,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:53:42,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:53:42,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:53:42,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (1/1) ... [2024-10-24 09:53:42,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:53:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:53:42,306 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-24 09:53:42,313 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-24 09:53:42,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:53:42,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:53:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:53:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:53:42,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:53:42,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:53:42,448 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:53:42,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:53:42,784 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 09:53:42,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:53:42,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:53:42,840 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:53:42,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:53:42 BoogieIcfgContainer [2024-10-24 09:53:42,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:53:42,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:53:42,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:53:42,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:53:42,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:53:41" (1/3) ... [2024-10-24 09:53:42,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7421e8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:53:42, skipping insertion in model container [2024-10-24 09:53:42,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:53:42" (2/3) ... [2024-10-24 09:53:42,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7421e8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:53:42, skipping insertion in model container [2024-10-24 09:53:42,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:53:42" (3/3) ... [2024-10-24 09:53:42,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-10-24 09:53:42,867 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:53:42,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:53:42,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:53:42,937 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;@72922f0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:53:42,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:53:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:53:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 09:53:42,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:42,950 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:42,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:42,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1864465112, now seen corresponding path program 1 times [2024-10-24 09:53:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57911905] [2024-10-24 09:53:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:53:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:53:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:53:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:53:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:53:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:53:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:53:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:53:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:53:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:53:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:53:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:53:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:53:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:53:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:53:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:53:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:53:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57911905] [2024-10-24 09:53:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57911905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:53:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6355699] [2024-10-24 09:53:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:43,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:53:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:53:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:53:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:53:43,478 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:53:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:43,519 INFO L93 Difference]: Finished difference Result 97 states and 166 transitions. [2024-10-24 09:53:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:53:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-10-24 09:53:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:43,528 INFO L225 Difference]: With dead ends: 97 [2024-10-24 09:53:43,528 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 09:53:43,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:53:43,535 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:43,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:53:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 09:53:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 09:53:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:53:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-24 09:53:43,574 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 97 [2024-10-24 09:53:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-24 09:53:43,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:53:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-24 09:53:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 09:53:43,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:43,579 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:53:43,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1284762918, now seen corresponding path program 1 times [2024-10-24 09:53:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574245405] [2024-10-24 09:53:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:53:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:53:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:53:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:53:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:53:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:53:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:53:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:53:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:53:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:53:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:53:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:53:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:53:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:53:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:53:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:53:44,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:53:44,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574245405] [2024-10-24 09:53:44,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574245405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:44,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:44,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:53:44,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162806631] [2024-10-24 09:53:44,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:44,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:53:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:53:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:53:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:53:44,097 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:44,300 INFO L93 Difference]: Finished difference Result 140 states and 212 transitions. [2024-10-24 09:53:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:53:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-24 09:53:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:44,305 INFO L225 Difference]: With dead ends: 140 [2024-10-24 09:53:44,306 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 09:53:44,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:53:44,309 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:44,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:53:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 09:53:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-10-24 09:53:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:53:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-10-24 09:53:44,344 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 97 [2024-10-24 09:53:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:44,344 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-10-24 09:53:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-10-24 09:53:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 09:53:44,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:44,351 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:44,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:53:44,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:44,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 697956904, now seen corresponding path program 1 times [2024-10-24 09:53:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921518012] [2024-10-24 09:53:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:53:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:53:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:53:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:53:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:53:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:53:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:53:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:53:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:53:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:53:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:53:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:53:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:53:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:53:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:53:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:53:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:53:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921518012] [2024-10-24 09:53:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921518012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:50,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:50,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 09:53:50,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957839414] [2024-10-24 09:53:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:50,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 09:53:50,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:53:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 09:53:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:53:50,488 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:51,411 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2024-10-24 09:53:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 09:53:51,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-24 09:53:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:51,414 INFO L225 Difference]: With dead ends: 192 [2024-10-24 09:53:51,414 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 09:53:51,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-10-24 09:53:51,419 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 203 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:51,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 391 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:53:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 09:53:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2024-10-24 09:53:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:53:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-10-24 09:53:51,447 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 97 [2024-10-24 09:53:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:51,449 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-10-24 09:53:51,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-10-24 09:53:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 09:53:51,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:51,452 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:51,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:53:51,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:51,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash 304929894, now seen corresponding path program 1 times [2024-10-24 09:53:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35009783] [2024-10-24 09:53:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:53:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:53:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:53:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:53:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:53:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:53:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:53:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:53:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:53:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:53:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:53:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:53:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:53:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:53:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:53:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:53:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:53:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35009783] [2024-10-24 09:53:51,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35009783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:51,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:51,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:53:51,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50377952] [2024-10-24 09:53:51,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:51,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:53:51,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:53:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:53:51,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:53:51,578 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:51,634 INFO L93 Difference]: Finished difference Result 182 states and 273 transitions. [2024-10-24 09:53:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:53:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-24 09:53:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:51,637 INFO L225 Difference]: With dead ends: 182 [2024-10-24 09:53:51,639 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 09:53:51,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-24 09:53:51,641 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:51,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:53:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 09:53:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-10-24 09:53:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:53:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2024-10-24 09:53:51,674 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 97 [2024-10-24 09:53:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:51,675 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2024-10-24 09:53:51,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2024-10-24 09:53:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:53:51,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:51,681 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:51,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:53:51,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1817372079, now seen corresponding path program 1 times [2024-10-24 09:53:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:51,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612893289] [2024-10-24 09:53:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:53:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:53:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:53:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:53:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:53:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:53:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:53:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:53:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:53:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:53:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:53:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:53:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:53:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:53:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:53:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:53:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:53:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612893289] [2024-10-24 09:53:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612893289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:51,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:51,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:53:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279718049] [2024-10-24 09:53:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:51,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:53:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:53:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:53:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:53:51,986 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:52,016 INFO L93 Difference]: Finished difference Result 235 states and 349 transitions. [2024-10-24 09:53:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:53:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 09:53:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:52,020 INFO L225 Difference]: With dead ends: 235 [2024-10-24 09:53:52,020 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 09:53:52,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-24 09:53:52,023 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:52,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:53:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 09:53:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2024-10-24 09:53:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:53:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-10-24 09:53:52,048 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 98 [2024-10-24 09:53:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:52,049 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-10-24 09:53:52,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-10-24 09:53:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:53:52,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:52,053 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:52,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:53:52,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1874630381, now seen corresponding path program 1 times [2024-10-24 09:53:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872392509] [2024-10-24 09:53:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:53:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:53:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:53:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:53:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:53:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:53:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:53:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:53:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:53:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:53:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:53:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:53:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:53:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:53:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:53:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:53:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:53:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:53:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872392509] [2024-10-24 09:53:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872392509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:53:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:53:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 09:53:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636142574] [2024-10-24 09:53:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:53:55,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 09:53:55,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:53:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 09:53:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-24 09:53:55,375 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:53:56,841 INFO L93 Difference]: Finished difference Result 186 states and 254 transitions. [2024-10-24 09:53:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 09:53:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 09:53:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:53:56,846 INFO L225 Difference]: With dead ends: 186 [2024-10-24 09:53:56,846 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 09:53:56,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-10-24 09:53:56,848 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 253 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:53:56,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 309 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 09:53:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 09:53:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2024-10-24 09:53:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:53:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-10-24 09:53:56,868 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 98 [2024-10-24 09:53:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:53:56,869 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-10-24 09:53:56,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:53:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-10-24 09:53:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:53:56,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:53:56,870 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:53:56,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:53:56,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:53:56,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:53:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 161647881, now seen corresponding path program 1 times [2024-10-24 09:53:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:53:56,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808861402] [2024-10-24 09:53:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:53:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:53:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808861402] [2024-10-24 09:54:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808861402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:00,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:00,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 09:54:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193180112] [2024-10-24 09:54:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 09:54:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 09:54:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 09:54:00,991 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:03,186 INFO L93 Difference]: Finished difference Result 182 states and 250 transitions. [2024-10-24 09:54:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 09:54:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 09:54:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:03,188 INFO L225 Difference]: With dead ends: 182 [2024-10-24 09:54:03,188 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 09:54:03,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2024-10-24 09:54:03,189 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 243 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:03,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 291 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 09:54:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 09:54:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 135. [2024-10-24 09:54:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2024-10-24 09:54:03,204 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 98 [2024-10-24 09:54:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:03,205 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2024-10-24 09:54:03,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2024-10-24 09:54:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:54:03,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:03,206 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:54:03,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:03,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 197735856, now seen corresponding path program 1 times [2024-10-24 09:54:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411780066] [2024-10-24 09:54:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411780066] [2024-10-24 09:54:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411780066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:07,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 09:54:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835140706] [2024-10-24 09:54:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:07,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 09:54:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 09:54:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:54:07,785 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:10,256 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2024-10-24 09:54:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 09:54:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 09:54:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:10,258 INFO L225 Difference]: With dead ends: 199 [2024-10-24 09:54:10,258 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 09:54:10,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2024-10-24 09:54:10,259 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 237 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:10,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 328 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 09:54:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 09:54:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2024-10-24 09:54:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-24 09:54:10,273 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-24 09:54:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:10,274 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-24 09:54:10,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-24 09:54:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:54:10,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:10,275 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 09:54:10,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -611610770, now seen corresponding path program 1 times [2024-10-24 09:54:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386730260] [2024-10-24 09:54:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386730260] [2024-10-24 09:54:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386730260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 09:54:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105106602] [2024-10-24 09:54:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 09:54:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 09:54:14,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 09:54:14,151 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:16,611 INFO L93 Difference]: Finished difference Result 193 states and 264 transitions. [2024-10-24 09:54:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 09:54:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-24 09:54:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:16,613 INFO L225 Difference]: With dead ends: 193 [2024-10-24 09:54:16,613 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 09:54:16,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2024-10-24 09:54:16,614 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 181 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:16,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 434 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 09:54:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 09:54:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2024-10-24 09:54:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-24 09:54:16,627 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-24 09:54:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:16,627 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-24 09:54:16,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-24 09:54:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 09:54:16,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:16,629 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 09:54:16,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:16,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -750476140, now seen corresponding path program 1 times [2024-10-24 09:54:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685688063] [2024-10-24 09:54:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685688063] [2024-10-24 09:54:24,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685688063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 09:54:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623398468] [2024-10-24 09:54:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:24,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:54:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:24,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:54:24,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:54:24,927 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:28,073 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2024-10-24 09:54:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 09:54:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-10-24 09:54:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:28,075 INFO L225 Difference]: With dead ends: 201 [2024-10-24 09:54:28,075 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 09:54:28,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=324, Invalid=798, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 09:54:28,077 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:28,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 371 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 09:54:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 09:54:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2024-10-24 09:54:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-10-24 09:54:28,093 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 99 [2024-10-24 09:54:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:28,093 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-10-24 09:54:28,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-10-24 09:54:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 09:54:28,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:28,097 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:28,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:54:28,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1559822766, now seen corresponding path program 1 times [2024-10-24 09:54:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655600301] [2024-10-24 09:54:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:37,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655600301] [2024-10-24 09:54:37,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655600301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:37,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:37,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 09:54:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656879372] [2024-10-24 09:54:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:37,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:54:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:54:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:54:37,011 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:41,645 INFO L93 Difference]: Finished difference Result 195 states and 268 transitions. [2024-10-24 09:54:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 09:54:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-10-24 09:54:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:41,646 INFO L225 Difference]: With dead ends: 195 [2024-10-24 09:54:41,646 INFO L226 Difference]: Without dead ends: 193 [2024-10-24 09:54:41,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=321, Invalid=735, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 09:54:41,647 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:41,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 388 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 09:54:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-24 09:54:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 145. [2024-10-24 09:54:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-10-24 09:54:41,664 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 99 [2024-10-24 09:54:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:41,664 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-10-24 09:54:41,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-10-24 09:54:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 09:54:41,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:41,666 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:41,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 09:54:41,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:41,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2016179996, now seen corresponding path program 1 times [2024-10-24 09:54:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210194861] [2024-10-24 09:54:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:45,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210194861] [2024-10-24 09:54:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210194861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:45,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 09:54:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592356405] [2024-10-24 09:54:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:45,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:54:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:54:45,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:54:45,566 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 09:54:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:48,040 INFO L93 Difference]: Finished difference Result 186 states and 256 transitions. [2024-10-24 09:54:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 09:54:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 99 [2024-10-24 09:54:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:48,042 INFO L225 Difference]: With dead ends: 186 [2024-10-24 09:54:48,042 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 09:54:48,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2024-10-24 09:54:48,043 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 166 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:48,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 422 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 09:54:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 09:54:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 142. [2024-10-24 09:54:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 93 states have internal predecessors, (116), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 206 transitions. [2024-10-24 09:54:48,062 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 206 transitions. Word has length 99 [2024-10-24 09:54:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:48,064 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 206 transitions. [2024-10-24 09:54:48,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 09:54:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 206 transitions. [2024-10-24 09:54:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 09:54:48,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:48,066 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:48,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 09:54:48,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -747320219, now seen corresponding path program 1 times [2024-10-24 09:54:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047523521] [2024-10-24 09:54:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:54:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:54:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:54:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:54:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:54:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:54:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:54:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047523521] [2024-10-24 09:54:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047523521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 09:54:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464447353] [2024-10-24 09:54:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:54:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:54:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:54:52,231 INFO L87 Difference]: Start difference. First operand 142 states and 206 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:55,561 INFO L93 Difference]: Finished difference Result 202 states and 274 transitions. [2024-10-24 09:54:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 09:54:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-10-24 09:54:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:55,563 INFO L225 Difference]: With dead ends: 202 [2024-10-24 09:54:55,563 INFO L226 Difference]: Without dead ends: 200 [2024-10-24 09:54:55,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 09:54:55,564 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 199 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:55,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 367 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 09:54:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-24 09:54:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 148. [2024-10-24 09:54:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 09:54:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2024-10-24 09:54:55,578 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 99 [2024-10-24 09:54:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:55,579 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2024-10-24 09:54:55,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2024-10-24 09:54:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 09:54:55,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:55,580 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:54:55,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 09:54:55,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1834724159, now seen corresponding path program 1 times [2024-10-24 09:54:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084721746] [2024-10-24 09:54:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:55:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:55:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:55:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:55:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:55:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:55:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:55:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:55:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:55:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:55:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:55:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:55:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 09:55:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:55:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 09:55:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:55:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:55:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:55:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084721746] [2024-10-24 09:55:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084721746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:55:00,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:55:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 09:55:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656727334] [2024-10-24 09:55:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:55:00,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 09:55:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:55:00,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 09:55:00,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-24 09:55:00,625 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)