./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.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 ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:04:15,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:04:15,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:04:15,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:04:15,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:04:15,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:04:15,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:04:15,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:04:15,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:04:15,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:04:15,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:04:15,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:04:15,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:04:15,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:04:15,986 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:04:15,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:04:15,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:04:15,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:04:15,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:04:15,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:04:15,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:04:15,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:04:15,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:04:15,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:04:15,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:04:15,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:04:15,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:04:15,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:04:15,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:04:15,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:04:15,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:04:15,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:04:15,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:04:15,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:04:15,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:04:15,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:04:15,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:04:15,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:04:15,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:04:15,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:04:15,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:04:15,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:04:15,994 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 -> ddaccc1a0ddb0072edffeef8ad9576acf619c322d8f731037fda7dc2530a10f9 [2024-11-09 02:04:16,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:04:16,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:04:16,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:04:16,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:04:16,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:04:16,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i [2024-11-09 02:04:17,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:04:17,607 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:04:17,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i [2024-11-09 02:04:17,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f5dc2b2/e8b90a38e2fe43ce92b5d2b786e138f3/FLAGd88948faa [2024-11-09 02:04:18,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f5dc2b2/e8b90a38e2fe43ce92b5d2b786e138f3 [2024-11-09 02:04:18,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:04:18,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:04:18,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:04:18,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:04:18,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:04:18,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd7c848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18, skipping insertion in model container [2024-11-09 02:04:18,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:04:18,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i[916,929] [2024-11-09 02:04:18,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:04:18,259 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:04:18,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-56.i[916,929] [2024-11-09 02:04:18,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:04:18,313 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:04:18,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18 WrapperNode [2024-11-09 02:04:18,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:04:18,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:04:18,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:04:18,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:04:18,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,373 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 571 [2024-11-09 02:04:18,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:04:18,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:04:18,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:04:18,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:04:18,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,393 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:04:18,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:04:18,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:04:18,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:04:18,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:04:18,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (1/1) ... [2024-11-09 02:04:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:04:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:04:18,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:04:18,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:04:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:04:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:04:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:04:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:04:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:04:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:04:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:04:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:04:18,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:04:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:04:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:04:18,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:04:18,635 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:04:18,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:04:19,145 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 02:04:19,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:04:19,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:04:19,183 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:04:19,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:04:19 BoogieIcfgContainer [2024-11-09 02:04:19,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:04:19,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:04:19,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:04:19,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:04:19,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:04:18" (1/3) ... [2024-11-09 02:04:19,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8a05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:04:19, skipping insertion in model container [2024-11-09 02:04:19,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:04:18" (2/3) ... [2024-11-09 02:04:19,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8a05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:04:19, skipping insertion in model container [2024-11-09 02:04:19,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:04:19" (3/3) ... [2024-11-09 02:04:19,194 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-56.i [2024-11-09 02:04:19,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:04:19,220 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:04:19,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:04:19,274 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;@438ee855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:04:19,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:04:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:04:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 02:04:19,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:19,290 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:19,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash 607828223, now seen corresponding path program 1 times [2024-11-09 02:04:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268100534] [2024-11-09 02:04:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:19,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:19,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268100534] [2024-11-09 02:04:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268100534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:04:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124930373] [2024-11-09 02:04:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:19,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:04:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:04:19,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:04:19,750 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:19,786 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-11-09 02:04:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:04:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-09 02:04:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:19,795 INFO L225 Difference]: With dead ends: 245 [2024-11-09 02:04:19,796 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 02:04:19,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-11-09 02:04:19,804 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:19,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:04:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 02:04:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 02:04:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:04:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-09 02:04:19,855 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-11-09 02:04:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-09 02:04:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-09 02:04:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 02:04:19,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:19,864 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:04:19,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1661937133, now seen corresponding path program 1 times [2024-11-09 02:04:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807850628] [2024-11-09 02:04:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:20,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807850628] [2024-11-09 02:04:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807850628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:20,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:20,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:04:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599920135] [2024-11-09 02:04:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:04:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:04:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:04:20,159 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:20,198 INFO L93 Difference]: Finished difference Result 243 states and 360 transitions. [2024-11-09 02:04:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:04:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-09 02:04:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:20,201 INFO L225 Difference]: With dead ends: 243 [2024-11-09 02:04:20,203 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 02:04:20,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:04:20,205 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:20,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:04:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 02:04:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 02:04:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:04:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-09 02:04:20,222 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 151 [2024-11-09 02:04:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:20,223 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-09 02:04:20,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-09 02:04:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 02:04:20,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:20,225 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:20,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:04:20,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 982664879, now seen corresponding path program 1 times [2024-11-09 02:04:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191552748] [2024-11-09 02:04:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191552748] [2024-11-09 02:04:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191552748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:04:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537366445] [2024-11-09 02:04:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:04:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:04:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:20,419 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:20,433 INFO L93 Difference]: Finished difference Result 246 states and 363 transitions. [2024-11-09 02:04:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:04:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-09 02:04:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:20,435 INFO L225 Difference]: With dead ends: 246 [2024-11-09 02:04:20,435 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 02:04:20,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:20,436 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:20,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:04:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 02:04:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 02:04:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:04:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-11-09 02:04:20,448 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 151 [2024-11-09 02:04:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:20,449 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-09 02:04:20,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2024-11-09 02:04:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 02:04:20,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:20,451 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:20,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:04:20,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:20,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash 165016429, now seen corresponding path program 1 times [2024-11-09 02:04:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834493272] [2024-11-09 02:04:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:21,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834493272] [2024-11-09 02:04:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834493272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:04:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882878345] [2024-11-09 02:04:21,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:04:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:21,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:04:21,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:04:21,783 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:23,123 INFO L93 Difference]: Finished difference Result 679 states and 1008 transitions. [2024-11-09 02:04:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 02:04:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-09 02:04:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:23,127 INFO L225 Difference]: With dead ends: 679 [2024-11-09 02:04:23,127 INFO L226 Difference]: Without dead ends: 557 [2024-11-09 02:04:23,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2024-11-09 02:04:23,129 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 992 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:23,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1016 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:04:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-09 02:04:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 295. [2024-11-09 02:04:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 254 states have (on average 1.4409448818897639) internal successors, (366), 254 states have internal predecessors, (366), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 442 transitions. [2024-11-09 02:04:23,150 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 442 transitions. Word has length 151 [2024-11-09 02:04:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 442 transitions. [2024-11-09 02:04:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 442 transitions. [2024-11-09 02:04:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:04:23,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:23,153 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:04:23,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash -6012814, now seen corresponding path program 1 times [2024-11-09 02:04:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956768922] [2024-11-09 02:04:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956768922] [2024-11-09 02:04:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956768922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:04:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810360031] [2024-11-09 02:04:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:04:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:04:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:23,258 INFO L87 Difference]: Start difference. First operand 295 states and 442 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:23,318 INFO L93 Difference]: Finished difference Result 586 states and 879 transitions. [2024-11-09 02:04:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:04:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-09 02:04:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:23,322 INFO L225 Difference]: With dead ends: 586 [2024-11-09 02:04:23,323 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 02:04:23,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:23,325 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:23,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:04:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 02:04:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-09 02:04:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 253 states have (on average 1.4308300395256917) internal successors, (362), 253 states have internal predecessors, (362), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 438 transitions. [2024-11-09 02:04:23,346 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 438 transitions. Word has length 152 [2024-11-09 02:04:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:23,346 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 438 transitions. [2024-11-09 02:04:23,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 438 transitions. [2024-11-09 02:04:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:04:23,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:23,348 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:04:23,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:23,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1365661008, now seen corresponding path program 1 times [2024-11-09 02:04:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660729181] [2024-11-09 02:04:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660729181] [2024-11-09 02:04:23,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660729181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:23,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:04:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108329764] [2024-11-09 02:04:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:23,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:04:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:04:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:23,459 INFO L87 Difference]: Start difference. First operand 294 states and 438 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:23,543 INFO L93 Difference]: Finished difference Result 589 states and 881 transitions. [2024-11-09 02:04:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:04:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-09 02:04:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:23,545 INFO L225 Difference]: With dead ends: 589 [2024-11-09 02:04:23,546 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 02:04:23,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:23,548 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:23,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:04:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 02:04:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-09 02:04:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 257 states have (on average 1.424124513618677) internal successors, (366), 257 states have internal predecessors, (366), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2024-11-09 02:04:23,561 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 152 [2024-11-09 02:04:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:23,562 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2024-11-09 02:04:23,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2024-11-09 02:04:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:04:23,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:23,565 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:04:23,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -28424802, now seen corresponding path program 1 times [2024-11-09 02:04:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855885272] [2024-11-09 02:04:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855885272] [2024-11-09 02:04:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855885272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:23,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:04:23,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439953045] [2024-11-09 02:04:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:04:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:04:23,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:23,673 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:23,749 INFO L93 Difference]: Finished difference Result 593 states and 881 transitions. [2024-11-09 02:04:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:04:23,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-09 02:04:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:23,752 INFO L225 Difference]: With dead ends: 593 [2024-11-09 02:04:23,752 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 02:04:23,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:23,754 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:23,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:04:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 02:04:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-09 02:04:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 257 states have (on average 1.416342412451362) internal successors, (364), 257 states have internal predecessors, (364), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 440 transitions. [2024-11-09 02:04:23,768 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 440 transitions. Word has length 152 [2024-11-09 02:04:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:23,769 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 440 transitions. [2024-11-09 02:04:23,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 440 transitions. [2024-11-09 02:04:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:23,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:23,771 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:23,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:04:23,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1035364039, now seen corresponding path program 1 times [2024-11-09 02:04:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819745890] [2024-11-09 02:04:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819745890] [2024-11-09 02:04:24,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819745890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:24,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:24,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:04:24,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666304601] [2024-11-09 02:04:24,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:24,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:04:24,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:24,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:04:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:04:24,052 INFO L87 Difference]: Start difference. First operand 298 states and 440 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:24,416 INFO L93 Difference]: Finished difference Result 709 states and 1054 transitions. [2024-11-09 02:04:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:04:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 02:04:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:24,419 INFO L225 Difference]: With dead ends: 709 [2024-11-09 02:04:24,419 INFO L226 Difference]: Without dead ends: 414 [2024-11-09 02:04:24,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:04:24,420 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 76 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:24,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 635 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:04:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-09 02:04:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2024-11-09 02:04:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 291 states have (on average 1.436426116838488) internal successors, (418), 291 states have internal predecessors, (418), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 494 transitions. [2024-11-09 02:04:24,429 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 494 transitions. Word has length 153 [2024-11-09 02:04:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:24,430 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 494 transitions. [2024-11-09 02:04:24,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 494 transitions. [2024-11-09 02:04:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:24,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:24,431 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:24,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:04:24,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:24,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash -618514157, now seen corresponding path program 1 times [2024-11-09 02:04:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:24,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083798144] [2024-11-09 02:04:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:27,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083798144] [2024-11-09 02:04:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083798144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:27,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 02:04:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418383576] [2024-11-09 02:04:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:27,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 02:04:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 02:04:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:04:27,132 INFO L87 Difference]: Start difference. First operand 332 states and 494 transitions. Second operand has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 02:04:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:29,434 INFO L93 Difference]: Finished difference Result 902 states and 1335 transitions. [2024-11-09 02:04:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 02:04:29,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-09 02:04:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:29,437 INFO L225 Difference]: With dead ends: 902 [2024-11-09 02:04:29,438 INFO L226 Difference]: Without dead ends: 573 [2024-11-09 02:04:29,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 02:04:29,440 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1300 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:29,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 1168 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 02:04:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-09 02:04:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 356. [2024-11-09 02:04:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 315 states have (on average 1.4476190476190476) internal successors, (456), 315 states have internal predecessors, (456), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2024-11-09 02:04:29,458 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 153 [2024-11-09 02:04:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2024-11-09 02:04:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 5.083333333333333) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 02:04:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2024-11-09 02:04:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:29,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:29,460 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:29,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:04:29,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:29,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1205320171, now seen corresponding path program 1 times [2024-11-09 02:04:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090744382] [2024-11-09 02:04:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090744382] [2024-11-09 02:04:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090744382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:04:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894445879] [2024-11-09 02:04:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:04:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:31,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:04:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:04:31,088 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:32,077 INFO L93 Difference]: Finished difference Result 859 states and 1289 transitions. [2024-11-09 02:04:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:04:32,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-09 02:04:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:32,080 INFO L225 Difference]: With dead ends: 859 [2024-11-09 02:04:32,080 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 02:04:32,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:04:32,082 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 75 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:32,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1317 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:04:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 02:04:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 425. [2024-11-09 02:04:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 384 states have (on average 1.4765625) internal successors, (567), 384 states have internal predecessors, (567), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 643 transitions. [2024-11-09 02:04:32,094 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 643 transitions. Word has length 153 [2024-11-09 02:04:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:32,095 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 643 transitions. [2024-11-09 02:04:32,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 643 transitions. [2024-11-09 02:04:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:32,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:32,096 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:32,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:04:32,096 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:32,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash 121992353, now seen corresponding path program 1 times [2024-11-09 02:04:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056748341] [2024-11-09 02:04:32,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:32,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056748341] [2024-11-09 02:04:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056748341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:04:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195872964] [2024-11-09 02:04:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:32,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:04:32,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:32,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:04:32,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:04:32,294 INFO L87 Difference]: Start difference. First operand 425 states and 643 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:32,584 INFO L93 Difference]: Finished difference Result 902 states and 1363 transitions. [2024-11-09 02:04:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:04:32,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 02:04:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:32,586 INFO L225 Difference]: With dead ends: 902 [2024-11-09 02:04:32,586 INFO L226 Difference]: Without dead ends: 480 [2024-11-09 02:04:32,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:04:32,587 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 73 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:32,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 436 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:04:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-09 02:04:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 411. [2024-11-09 02:04:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 370 states have (on average 1.454054054054054) internal successors, (538), 370 states have internal predecessors, (538), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2024-11-09 02:04:32,598 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 153 [2024-11-09 02:04:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:32,598 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2024-11-09 02:04:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2024-11-09 02:04:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:32,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:32,600 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:32,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:04:32,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1868831367, now seen corresponding path program 1 times [2024-11-09 02:04:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901495939] [2024-11-09 02:04:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901495939] [2024-11-09 02:04:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901495939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:04:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419823814] [2024-11-09 02:04:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:34,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:04:34,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:04:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:04:34,259 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand has 13 states, 9 states have (on average 6.777777777777778) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 02:04:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:35,687 INFO L93 Difference]: Finished difference Result 1008 states and 1505 transitions. [2024-11-09 02:04:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:04:35,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 6.777777777777778) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-09 02:04:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:35,689 INFO L225 Difference]: With dead ends: 1008 [2024-11-09 02:04:35,689 INFO L226 Difference]: Without dead ends: 600 [2024-11-09 02:04:35,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:04:35,691 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 215 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:35,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1136 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 02:04:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-09 02:04:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 453. [2024-11-09 02:04:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 412 states have (on average 1.4611650485436893) internal successors, (602), 412 states have internal predecessors, (602), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 678 transitions. [2024-11-09 02:04:35,701 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 678 transitions. Word has length 153 [2024-11-09 02:04:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:35,702 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 678 transitions. [2024-11-09 02:04:35,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 6.777777777777778) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 02:04:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 678 transitions. [2024-11-09 02:04:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:35,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:35,703 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:35,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:04:35,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1562524430, now seen corresponding path program 1 times [2024-11-09 02:04:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766794266] [2024-11-09 02:04:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:35,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766794266] [2024-11-09 02:04:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766794266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:35,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:04:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294136354] [2024-11-09 02:04:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:35,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:04:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:04:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:04:35,834 INFO L87 Difference]: Start difference. First operand 453 states and 678 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:35,857 INFO L93 Difference]: Finished difference Result 909 states and 1361 transitions. [2024-11-09 02:04:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:04:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 02:04:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:35,860 INFO L225 Difference]: With dead ends: 909 [2024-11-09 02:04:35,860 INFO L226 Difference]: Without dead ends: 459 [2024-11-09 02:04:35,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:04:35,862 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:35,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:04:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-09 02:04:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-11-09 02:04:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 418 states have (on average 1.4545454545454546) internal successors, (608), 418 states have internal predecessors, (608), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 02:04:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 684 transitions. [2024-11-09 02:04:35,874 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 684 transitions. Word has length 153 [2024-11-09 02:04:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:35,874 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 684 transitions. [2024-11-09 02:04:35,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 684 transitions. [2024-11-09 02:04:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:35,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:35,876 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:35,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:04:35,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:35,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash 588967689, now seen corresponding path program 1 times [2024-11-09 02:04:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915503745] [2024-11-09 02:04:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915503745] [2024-11-09 02:04:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915503745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:37,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:04:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499517920] [2024-11-09 02:04:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:04:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:04:37,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:04:37,115 INFO L87 Difference]: Start difference. First operand 459 states and 684 transitions. Second operand has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:38,367 INFO L93 Difference]: Finished difference Result 1168 states and 1717 transitions. [2024-11-09 02:04:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:04:38,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 02:04:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:38,372 INFO L225 Difference]: With dead ends: 1168 [2024-11-09 02:04:38,373 INFO L226 Difference]: Without dead ends: 712 [2024-11-09 02:04:38,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-09 02:04:38,374 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 811 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:38,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1098 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:04:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-09 02:04:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 527. [2024-11-09 02:04:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 481 states have (on average 1.4386694386694387) internal successors, (692), 482 states have internal predecessors, (692), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:04:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 776 transitions. [2024-11-09 02:04:38,392 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 776 transitions. Word has length 153 [2024-11-09 02:04:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:38,392 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 776 transitions. [2024-11-09 02:04:38,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 776 transitions. [2024-11-09 02:04:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:38,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:38,394 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:38,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:04:38,394 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:38,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2002844873, now seen corresponding path program 1 times [2024-11-09 02:04:38,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:38,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81744483] [2024-11-09 02:04:38,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:38,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81744483] [2024-11-09 02:04:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81744483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:04:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312228317] [2024-11-09 02:04:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:04:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:04:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:04:39,547 INFO L87 Difference]: Start difference. First operand 527 states and 776 transitions. Second operand has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:40,226 INFO L93 Difference]: Finished difference Result 808 states and 1187 transitions. [2024-11-09 02:04:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:04:40,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-09 02:04:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:40,232 INFO L225 Difference]: With dead ends: 808 [2024-11-09 02:04:40,232 INFO L226 Difference]: Without dead ends: 619 [2024-11-09 02:04:40,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:04:40,234 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 69 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:40,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1059 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:04:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-09 02:04:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 528. [2024-11-09 02:04:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 482 states have (on average 1.437759336099585) internal successors, (693), 483 states have internal predecessors, (693), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:04:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 777 transitions. [2024-11-09 02:04:40,249 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 777 transitions. Word has length 153 [2024-11-09 02:04:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:40,250 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 777 transitions. [2024-11-09 02:04:40,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.714285714285714) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 777 transitions. [2024-11-09 02:04:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:40,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:40,252 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:40,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:04:40,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:40,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1714793261, now seen corresponding path program 1 times [2024-11-09 02:04:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19760816] [2024-11-09 02:04:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:40,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:41,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:41,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19760816] [2024-11-09 02:04:41,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19760816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:41,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:41,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:04:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777639903] [2024-11-09 02:04:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:41,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:04:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:04:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:04:41,567 INFO L87 Difference]: Start difference. First operand 528 states and 777 transitions. Second operand has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:42,592 INFO L93 Difference]: Finished difference Result 1194 states and 1749 transitions. [2024-11-09 02:04:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 02:04:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-09 02:04:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:42,596 INFO L225 Difference]: With dead ends: 1194 [2024-11-09 02:04:42,596 INFO L226 Difference]: Without dead ends: 669 [2024-11-09 02:04:42,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:04:42,598 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1551 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:42,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 623 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:04:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-09 02:04:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 528. [2024-11-09 02:04:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 482 states have (on average 1.4356846473029046) internal successors, (692), 483 states have internal predecessors, (692), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:04:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 776 transitions. [2024-11-09 02:04:42,614 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 776 transitions. Word has length 153 [2024-11-09 02:04:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:42,615 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 776 transitions. [2024-11-09 02:04:42,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 776 transitions. [2024-11-09 02:04:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:42,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:42,617 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:42,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:04:42,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1652753647, now seen corresponding path program 1 times [2024-11-09 02:04:42,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987527483] [2024-11-09 02:04:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987527483] [2024-11-09 02:04:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987527483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:04:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313787084] [2024-11-09 02:04:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:04:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:04:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:04:43,884 INFO L87 Difference]: Start difference. First operand 528 states and 776 transitions. Second operand has 11 states, 8 states have (on average 7.625) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:44,781 INFO L93 Difference]: Finished difference Result 1249 states and 1833 transitions. [2024-11-09 02:04:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:04:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.625) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-11-09 02:04:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:44,784 INFO L225 Difference]: With dead ends: 1249 [2024-11-09 02:04:44,784 INFO L226 Difference]: Without dead ends: 724 [2024-11-09 02:04:44,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:04:44,786 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 130 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:44,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1301 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:04:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-09 02:04:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 528. [2024-11-09 02:04:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 482 states have (on average 1.4356846473029046) internal successors, (692), 483 states have internal predecessors, (692), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:04:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 776 transitions. [2024-11-09 02:04:44,805 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 776 transitions. Word has length 153 [2024-11-09 02:04:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:44,806 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 776 transitions. [2024-11-09 02:04:44,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.625) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:04:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 776 transitions. [2024-11-09 02:04:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:44,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:44,807 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:44,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:04:44,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1359358277, now seen corresponding path program 1 times [2024-11-09 02:04:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531357388] [2024-11-09 02:04:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531357388] [2024-11-09 02:04:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531357388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:04:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775166615] [2024-11-09 02:04:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:04:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:04:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:04:45,938 INFO L87 Difference]: Start difference. First operand 528 states and 776 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:47,098 INFO L93 Difference]: Finished difference Result 1281 states and 1863 transitions. [2024-11-09 02:04:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:04:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 02:04:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:47,101 INFO L225 Difference]: With dead ends: 1281 [2024-11-09 02:04:47,101 INFO L226 Difference]: Without dead ends: 756 [2024-11-09 02:04:47,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-09 02:04:47,102 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 727 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:47,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1039 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:04:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-09 02:04:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 525. [2024-11-09 02:04:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 479 states have (on average 1.4342379958246347) internal successors, (687), 480 states have internal predecessors, (687), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 02:04:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 771 transitions. [2024-11-09 02:04:47,125 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 771 transitions. Word has length 153 [2024-11-09 02:04:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:47,125 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 771 transitions. [2024-11-09 02:04:47,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 771 transitions. [2024-11-09 02:04:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:47,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:47,127 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:47,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:04:47,127 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:47,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash 79494599, now seen corresponding path program 1 times [2024-11-09 02:04:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534008015] [2024-11-09 02:04:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:47,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:47,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534008015] [2024-11-09 02:04:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534008015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:04:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537896280] [2024-11-09 02:04:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:47,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:04:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:04:47,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:04:47,318 INFO L87 Difference]: Start difference. First operand 525 states and 771 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:47,568 INFO L93 Difference]: Finished difference Result 1202 states and 1749 transitions. [2024-11-09 02:04:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:04:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 02:04:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:47,571 INFO L225 Difference]: With dead ends: 1202 [2024-11-09 02:04:47,571 INFO L226 Difference]: Without dead ends: 680 [2024-11-09 02:04:47,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:04:47,573 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 62 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:47,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 585 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:04:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-09 02:04:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 580. [2024-11-09 02:04:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 529 states have (on average 1.4234404536862004) internal successors, (753), 531 states have internal predecessors, (753), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:04:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 845 transitions. [2024-11-09 02:04:47,589 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 845 transitions. Word has length 153 [2024-11-09 02:04:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:47,589 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 845 transitions. [2024-11-09 02:04:47,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 845 transitions. [2024-11-09 02:04:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:04:47,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:47,591 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:47,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:04:47,591 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:47,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -507311415, now seen corresponding path program 1 times [2024-11-09 02:04:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779896343] [2024-11-09 02:04:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779896343] [2024-11-09 02:04:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779896343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:48,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:48,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:04:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286164443] [2024-11-09 02:04:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:04:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:04:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:04:48,626 INFO L87 Difference]: Start difference. First operand 580 states and 845 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:49,383 INFO L93 Difference]: Finished difference Result 1285 states and 1869 transitions. [2024-11-09 02:04:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:04:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 02:04:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:49,387 INFO L225 Difference]: With dead ends: 1285 [2024-11-09 02:04:49,387 INFO L226 Difference]: Without dead ends: 708 [2024-11-09 02:04:49,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:04:49,390 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 68 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:49,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1101 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:04:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-09 02:04:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 600. [2024-11-09 02:04:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 549 states have (on average 1.424408014571949) internal successors, (782), 551 states have internal predecessors, (782), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:04:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 874 transitions. [2024-11-09 02:04:49,410 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 874 transitions. Word has length 153 [2024-11-09 02:04:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:49,411 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 874 transitions. [2024-11-09 02:04:49,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 874 transitions. [2024-11-09 02:04:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 02:04:49,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:49,412 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:49,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 02:04:49,413 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:49,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1669219568, now seen corresponding path program 1 times [2024-11-09 02:04:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743180849] [2024-11-09 02:04:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:49,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:49,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743180849] [2024-11-09 02:04:49,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743180849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:49,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:49,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:04:49,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114637] [2024-11-09 02:04:49,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:49,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:04:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:49,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:04:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:49,485 INFO L87 Difference]: Start difference. First operand 600 states and 874 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:49,563 INFO L93 Difference]: Finished difference Result 1194 states and 1739 transitions. [2024-11-09 02:04:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:04:49,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-09 02:04:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:49,567 INFO L225 Difference]: With dead ends: 1194 [2024-11-09 02:04:49,567 INFO L226 Difference]: Without dead ends: 597 [2024-11-09 02:04:49,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:04:49,568 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:49,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:04:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-09 02:04:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2024-11-09 02:04:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 546 states have (on average 1.4175824175824177) internal successors, (774), 548 states have internal predecessors, (774), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:04:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 866 transitions. [2024-11-09 02:04:49,583 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 866 transitions. Word has length 154 [2024-11-09 02:04:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:49,583 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 866 transitions. [2024-11-09 02:04:49,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:04:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 866 transitions. [2024-11-09 02:04:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:04:49,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:49,585 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:49,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 02:04:49,585 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:49,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1902565229, now seen corresponding path program 1 times [2024-11-09 02:04:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925676287] [2024-11-09 02:04:49,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:49,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925676287] [2024-11-09 02:04:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925676287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:50,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:50,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 02:04:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221276879] [2024-11-09 02:04:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:50,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:04:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:04:50,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:04:50,746 INFO L87 Difference]: Start difference. First operand 597 states and 866 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:51,777 INFO L93 Difference]: Finished difference Result 1325 states and 1920 transitions. [2024-11-09 02:04:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:04:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 02:04:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:51,785 INFO L225 Difference]: With dead ends: 1325 [2024-11-09 02:04:51,785 INFO L226 Difference]: Without dead ends: 731 [2024-11-09 02:04:51,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:04:51,788 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 74 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:51,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1684 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:04:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-09 02:04:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 651. [2024-11-09 02:04:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 600 states have (on average 1.4233333333333333) internal successors, (854), 602 states have internal predecessors, (854), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 02:04:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 946 transitions. [2024-11-09 02:04:51,813 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 946 transitions. Word has length 155 [2024-11-09 02:04:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:51,814 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 946 transitions. [2024-11-09 02:04:51,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 946 transitions. [2024-11-09 02:04:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:04:51,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:51,816 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 02:04:51,816 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2134236629, now seen corresponding path program 1 times [2024-11-09 02:04:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:51,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719899502] [2024-11-09 02:04:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719899502] [2024-11-09 02:04:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719899502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:04:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003426229] [2024-11-09 02:04:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:04:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:04:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:04:52,568 INFO L87 Difference]: Start difference. First operand 651 states and 946 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:53,118 INFO L93 Difference]: Finished difference Result 1449 states and 2100 transitions. [2024-11-09 02:04:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:04:53,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 02:04:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:53,121 INFO L225 Difference]: With dead ends: 1449 [2024-11-09 02:04:53,121 INFO L226 Difference]: Without dead ends: 801 [2024-11-09 02:04:53,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:04:53,123 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 78 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:53,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 757 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:04:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-09 02:04:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 797. [2024-11-09 02:04:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 732 states have (on average 1.4125683060109289) internal successors, (1034), 736 states have internal predecessors, (1034), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 02:04:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1150 transitions. [2024-11-09 02:04:53,142 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1150 transitions. Word has length 155 [2024-11-09 02:04:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:53,142 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1150 transitions. [2024-11-09 02:04:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1150 transitions. [2024-11-09 02:04:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:04:53,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:53,144 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:53,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 02:04:53,144 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:53,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1381284817, now seen corresponding path program 1 times [2024-11-09 02:04:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306769731] [2024-11-09 02:04:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:53,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306769731] [2024-11-09 02:04:53,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306769731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:53,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:53,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:04:53,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596069626] [2024-11-09 02:04:53,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:53,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:04:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:04:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:04:53,871 INFO L87 Difference]: Start difference. First operand 797 states and 1150 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:54,176 INFO L93 Difference]: Finished difference Result 1771 states and 2554 transitions. [2024-11-09 02:04:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:04:54,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 02:04:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:54,180 INFO L225 Difference]: With dead ends: 1771 [2024-11-09 02:04:54,180 INFO L226 Difference]: Without dead ends: 977 [2024-11-09 02:04:54,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:04:54,181 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 65 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:54,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 679 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:04:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-09 02:04:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 839. [2024-11-09 02:04:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 774 states have (on average 1.4134366925064599) internal successors, (1094), 778 states have internal predecessors, (1094), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 02:04:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1210 transitions. [2024-11-09 02:04:54,203 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1210 transitions. Word has length 155 [2024-11-09 02:04:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:54,203 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1210 transitions. [2024-11-09 02:04:54,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:04:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1210 transitions. [2024-11-09 02:04:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:04:54,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:54,205 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:54,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 02:04:54,205 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:54,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash -469174033, now seen corresponding path program 1 times [2024-11-09 02:04:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:54,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820179922] [2024-11-09 02:04:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:55,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:55,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820179922] [2024-11-09 02:04:55,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820179922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:55,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:55,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:04:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705011944] [2024-11-09 02:04:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:55,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:04:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:04:55,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:04:55,002 INFO L87 Difference]: Start difference. First operand 839 states and 1210 transitions. Second operand has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:55,740 INFO L93 Difference]: Finished difference Result 1878 states and 2698 transitions. [2024-11-09 02:04:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:04:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 02:04:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:55,744 INFO L225 Difference]: With dead ends: 1878 [2024-11-09 02:04:55,744 INFO L226 Difference]: Without dead ends: 1042 [2024-11-09 02:04:55,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:04:55,746 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 168 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:55,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 973 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:04:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-09 02:04:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 850. [2024-11-09 02:04:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 780 states have (on average 1.4076923076923078) internal successors, (1098), 785 states have internal predecessors, (1098), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 02:04:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1222 transitions. [2024-11-09 02:04:55,771 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1222 transitions. Word has length 155 [2024-11-09 02:04:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:55,771 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1222 transitions. [2024-11-09 02:04:55,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1222 transitions. [2024-11-09 02:04:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:04:55,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:55,773 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 02:04:55,773 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash -211008595, now seen corresponding path program 1 times [2024-11-09 02:04:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19554762] [2024-11-09 02:04:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19554762] [2024-11-09 02:04:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19554762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 02:04:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937365334] [2024-11-09 02:04:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:04:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:04:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:04:57,207 INFO L87 Difference]: Start difference. First operand 850 states and 1222 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:04:58,772 INFO L93 Difference]: Finished difference Result 1814 states and 2604 transitions. [2024-11-09 02:04:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 02:04:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 02:04:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:04:58,777 INFO L225 Difference]: With dead ends: 1814 [2024-11-09 02:04:58,777 INFO L226 Difference]: Without dead ends: 980 [2024-11-09 02:04:58,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-11-09 02:04:58,779 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 171 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:04:58,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 2171 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 02:04:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-09 02:04:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 872. [2024-11-09 02:04:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 802 states have (on average 1.4077306733167083) internal successors, (1129), 807 states have internal predecessors, (1129), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 02:04:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1253 transitions. [2024-11-09 02:04:58,805 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1253 transitions. Word has length 155 [2024-11-09 02:04:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:04:58,805 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1253 transitions. [2024-11-09 02:04:58,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:04:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1253 transitions. [2024-11-09 02:04:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:04:58,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:04:58,807 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:04:58,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 02:04:58,807 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:04:58,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:04:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash -76995089, now seen corresponding path program 1 times [2024-11-09 02:04:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:04:58,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162866218] [2024-11-09 02:04:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:04:58,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:04:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:04:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:04:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:04:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:04:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:04:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:04:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:04:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:04:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:04:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:04:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:04:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:04:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:04:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:04:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:04:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:04:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:04:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:04:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:04:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:04:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:04:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:04:59,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162866218] [2024-11-09 02:04:59,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162866218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:04:59,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:04:59,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:04:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460001196] [2024-11-09 02:04:59,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:04:59,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:04:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:04:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:04:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:04:59,842 INFO L87 Difference]: Start difference. First operand 872 states and 1253 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:05:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:00,632 INFO L93 Difference]: Finished difference Result 1345 states and 1929 transitions. [2024-11-09 02:05:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 02:05:00,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 02:05:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:00,635 INFO L225 Difference]: With dead ends: 1345 [2024-11-09 02:05:00,635 INFO L226 Difference]: Without dead ends: 947 [2024-11-09 02:05:00,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-11-09 02:05:00,636 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 64 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:00,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1693 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:05:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-09 02:05:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 854. [2024-11-09 02:05:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 784 states have (on average 1.405612244897959) internal successors, (1102), 789 states have internal predecessors, (1102), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 02:05:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1226 transitions. [2024-11-09 02:05:00,659 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1226 transitions. Word has length 155 [2024-11-09 02:05:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:00,659 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1226 transitions. [2024-11-09 02:05:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:05:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1226 transitions. [2024-11-09 02:05:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:05:00,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:00,660 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 02:05:00,661 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 516361835, now seen corresponding path program 1 times [2024-11-09 02:05:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008747739] [2024-11-09 02:05:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:05:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:05:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:05:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:05:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:05:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:05:01,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:01,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008747739] [2024-11-09 02:05:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008747739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:05:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863544383] [2024-11-09 02:05:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:05:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:05:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:05:01,317 INFO L87 Difference]: Start difference. First operand 854 states and 1226 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:05:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:01,671 INFO L93 Difference]: Finished difference Result 1756 states and 2522 transitions. [2024-11-09 02:05:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:05:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-09 02:05:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:01,676 INFO L225 Difference]: With dead ends: 1756 [2024-11-09 02:05:01,676 INFO L226 Difference]: Without dead ends: 918 [2024-11-09 02:05:01,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:01,678 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 63 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:01,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 712 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:05:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-09 02:05:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 854. [2024-11-09 02:05:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 784 states have (on average 1.4005102040816326) internal successors, (1098), 789 states have internal predecessors, (1098), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-09 02:05:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1222 transitions. [2024-11-09 02:05:01,702 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1222 transitions. Word has length 155 [2024-11-09 02:05:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:01,703 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1222 transitions. [2024-11-09 02:05:01,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:05:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1222 transitions. [2024-11-09 02:05:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:05:01,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:01,704 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 02:05:01,704 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1527479085, now seen corresponding path program 1 times [2024-11-09 02:05:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449380625] [2024-11-09 02:05:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:05:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:05:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:05:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:05:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:05:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:05:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449380625] [2024-11-09 02:05:02,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449380625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:02,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:02,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 02:05:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348340863] [2024-11-09 02:05:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:02,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:05:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:05:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:05:02,908 INFO L87 Difference]: Start difference. First operand 854 states and 1222 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:05:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:04,175 INFO L93 Difference]: Finished difference Result 1854 states and 2645 transitions. [2024-11-09 02:05:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 02:05:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 02:05:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:04,179 INFO L225 Difference]: With dead ends: 1854 [2024-11-09 02:05:04,179 INFO L226 Difference]: Without dead ends: 1016 [2024-11-09 02:05:04,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-11-09 02:05:04,180 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 187 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:04,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 2047 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:05:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-09 02:05:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 954. [2024-11-09 02:05:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 879 states have (on average 1.398179749715586) internal successors, (1229), 885 states have internal predecessors, (1229), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 02:05:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1361 transitions. [2024-11-09 02:05:04,207 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1361 transitions. Word has length 155 [2024-11-09 02:05:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1361 transitions. [2024-11-09 02:05:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:05:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1361 transitions. [2024-11-09 02:05:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:05:04,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:04,209 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:04,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 02:05:04,209 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1661492591, now seen corresponding path program 1 times [2024-11-09 02:05:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:04,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182803002] [2024-11-09 02:05:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:05:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:05:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:05:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:05:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:05:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:05:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182803002] [2024-11-09 02:05:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182803002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 02:05:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63607473] [2024-11-09 02:05:05,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:05:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:05:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:05:05,198 INFO L87 Difference]: Start difference. First operand 954 states and 1361 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:05:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:06,221 INFO L93 Difference]: Finished difference Result 1419 states and 2020 transitions. [2024-11-09 02:05:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:05:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 02:05:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:06,225 INFO L225 Difference]: With dead ends: 1419 [2024-11-09 02:05:06,225 INFO L226 Difference]: Without dead ends: 971 [2024-11-09 02:05:06,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:05:06,226 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 77 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:06,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 2016 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:05:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-09 02:05:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 931. [2024-11-09 02:05:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 856 states have (on average 1.397196261682243) internal successors, (1196), 862 states have internal predecessors, (1196), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 02:05:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1328 transitions. [2024-11-09 02:05:06,254 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1328 transitions. Word has length 155 [2024-11-09 02:05:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:06,254 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1328 transitions. [2024-11-09 02:05:06,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:05:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1328 transitions. [2024-11-09 02:05:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:05:06,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:06,255 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:06,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 02:05:06,256 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -586094739, now seen corresponding path program 1 times [2024-11-09 02:05:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272083349] [2024-11-09 02:05:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:05:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:05:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:05:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:05:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:05:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:05:07,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:07,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272083349] [2024-11-09 02:05:07,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272083349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:07,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:07,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 02:05:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458773480] [2024-11-09 02:05:07,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:07,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:05:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:07,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:05:07,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:05:07,632 INFO L87 Difference]: Start difference. First operand 931 states and 1328 transitions. Second operand has 18 states, 15 states have (on average 4.2) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:05:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:09,581 INFO L93 Difference]: Finished difference Result 2015 states and 2865 transitions. [2024-11-09 02:05:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 02:05:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.2) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-09 02:05:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:09,586 INFO L225 Difference]: With dead ends: 2015 [2024-11-09 02:05:09,587 INFO L226 Difference]: Without dead ends: 1087 [2024-11-09 02:05:09,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-11-09 02:05:09,588 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 189 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:09,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 2583 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 02:05:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-11-09 02:05:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 948. [2024-11-09 02:05:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 873 states have (on average 1.3986254295532645) internal successors, (1221), 879 states have internal predecessors, (1221), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 02:05:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1353 transitions. [2024-11-09 02:05:09,617 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1353 transitions. Word has length 155 [2024-11-09 02:05:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1353 transitions. [2024-11-09 02:05:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.2) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-09 02:05:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1353 transitions. [2024-11-09 02:05:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:05:09,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:09,619 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:09,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 02:05:09,620 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:09,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash -452081233, now seen corresponding path program 1 times [2024-11-09 02:05:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813240340] [2024-11-09 02:05:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:05:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:05:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:05:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:05:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:05:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:05:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:05:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 02:05:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 02:05:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:05:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813240340] [2024-11-09 02:05:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813240340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 02:05:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717655950] [2024-11-09 02:05:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:10,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:05:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:05:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:05:10,611 INFO L87 Difference]: Start difference. First operand 948 states and 1353 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:05:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:11,530 INFO L93 Difference]: Finished difference Result 1487 states and 2114 transitions. [2024-11-09 02:05:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:05:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-09 02:05:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:11,533 INFO L225 Difference]: With dead ends: 1487 [2024-11-09 02:05:11,533 INFO L226 Difference]: Without dead ends: 1042 [2024-11-09 02:05:11,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:05:11,534 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 77 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:11,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1890 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:05:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-09 02:05:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 925. [2024-11-09 02:05:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 850 states have (on average 1.3976470588235295) internal successors, (1188), 856 states have internal predecessors, (1188), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-09 02:05:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1320 transitions. [2024-11-09 02:05:11,562 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1320 transitions. Word has length 155 [2024-11-09 02:05:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:11,563 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1320 transitions. [2024-11-09 02:05:11,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:05:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1320 transitions. [2024-11-09 02:05:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:05:11,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:11,564 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:11,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 02:05:11,564 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash 515215021, now seen corresponding path program 1 times [2024-11-09 02:05:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235208038] [2024-11-09 02:05:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat