./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_codestructure_dependencies_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:07:39,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:07:39,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:07:39,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:07:39,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:07:39,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:07:39,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:07:39,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:07:39,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:07:39,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:07:39,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:07:39,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:07:39,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:07:39,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:07:39,743 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:07:39,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:07:39,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:07:39,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:07:39,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:07:39,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:07:39,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:07:39,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:07:39,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:07:39,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:07:39,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:07:39,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:07:39,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:07:39,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:07:39,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:07:39,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:07:39,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:07:39,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:07:39,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:07:39,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:07:39,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:07:39,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:07:39,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:07:39,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:07:39,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:07:39,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:07:39,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:07:39,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:07:39,756 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 -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2024-11-12 01:07:40,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:07:40,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:07:40,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:07:40,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:07:40,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:07:40,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-11-12 01:07:41,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:07:41,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:07:41,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-11-12 01:07:41,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e890068/1cd90c51664347fbb9367b4d709b3e20/FLAG23fb3c944 [2024-11-12 01:07:41,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e890068/1cd90c51664347fbb9367b4d709b3e20 [2024-11-12 01:07:41,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:07:41,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:07:41,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:07:41,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:07:41,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:07:41,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:07:41" (1/1) ... [2024-11-12 01:07:41,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50da7e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:41, skipping insertion in model container [2024-11-12 01:07:41,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:07:41" (1/1) ... [2024-11-12 01:07:41,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:07:42,074 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_codestructure_dependencies_file-86.i[919,932] [2024-11-12 01:07:42,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:07:42,151 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:07:42,161 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_codestructure_dependencies_file-86.i[919,932] [2024-11-12 01:07:42,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:07:42,247 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:07:42,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42 WrapperNode [2024-11-12 01:07:42,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:07:42,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:07:42,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:07:42,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:07:42,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,337 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-12 01:07:42,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:07:42,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:07:42,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:07:42,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:07:42,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,393 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:07:42,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:07:42,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:07:42,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:07:42,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:07:42,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (1/1) ... [2024-11-12 01:07:42,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:07:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:07:42,470 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-12 01:07:42,474 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-12 01:07:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:07:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:07:42,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:07:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:07:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:07:42,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:07:42,592 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:07:42,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:07:43,024 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:07:43,025 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:07:43,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:07:43,040 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:07:43,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:07:43 BoogieIcfgContainer [2024-11-12 01:07:43,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:07:43,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:07:43,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:07:43,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:07:43,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:07:41" (1/3) ... [2024-11-12 01:07:43,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537a62ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:07:43, skipping insertion in model container [2024-11-12 01:07:43,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:42" (2/3) ... [2024-11-12 01:07:43,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537a62ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:07:43, skipping insertion in model container [2024-11-12 01:07:43,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:07:43" (3/3) ... [2024-11-12 01:07:43,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2024-11-12 01:07:43,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:07:43,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:07:43,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:07:43,147 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;@32e7d0d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:07:43,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:07:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 01:07:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 01:07:43,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:43,168 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:43,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2100497442, now seen corresponding path program 1 times [2024-11-12 01:07:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:07:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862800929] [2024-11-12 01:07:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:07:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:07:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:07:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:07:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:07:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:07:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:07:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:07:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:07:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:07:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:07:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:07:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:07:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:07:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:07:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:07:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:07:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:07:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862800929] [2024-11-12 01:07:43,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862800929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:43,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:43,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:07:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500565492] [2024-11-12 01:07:43,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:07:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:07:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:07:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:07:43,692 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 01:07:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:07:43,728 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2024-11-12 01:07:43,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:07:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-12 01:07:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:07:43,743 INFO L225 Difference]: With dead ends: 97 [2024-11-12 01:07:43,743 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 01:07:43,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:07:43,752 INFO L435 NwaCegarLoop]: 71 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, 71 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-12 01:07:43,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:07:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 01:07:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 01:07:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 01:07:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-12 01:07:43,801 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 98 [2024-11-12 01:07:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:07:43,801 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-12 01:07:43,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 01:07:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-12 01:07:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 01:07:43,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:43,807 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:43,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:07:43,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:43,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1585339296, now seen corresponding path program 1 times [2024-11-12 01:07:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:07:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842863648] [2024-11-12 01:07:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:07:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:07:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:07:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:07:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:07:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:07:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:07:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:07:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:07:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:07:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:07:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:07:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:07:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:07:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:07:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:07:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:07:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:07:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842863648] [2024-11-12 01:07:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842863648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:44,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:44,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:07:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836451478] [2024-11-12 01:07:44,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:44,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:07:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:07:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:07:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:07:44,397 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:07:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:07:44,623 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-12 01:07:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:07:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-12 01:07:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:07:44,627 INFO L225 Difference]: With dead ends: 139 [2024-11-12 01:07:44,628 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 01:07:44,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:07:44,631 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:07:44,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 191 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:07:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 01:07:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-12 01:07:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:07:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-12 01:07:44,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 98 [2024-11-12 01:07:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:07:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-12 01:07:44,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:07:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-12 01:07:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 01:07:44,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:44,681 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:44,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:07:44,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2029569630, now seen corresponding path program 1 times [2024-11-12 01:07:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:07:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252276596] [2024-11-12 01:07:44,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:07:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:07:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:07:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:07:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:07:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:07:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:07:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:07:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:07:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:07:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:07:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:07:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:07:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:07:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:07:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:07:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:07:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:07:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252276596] [2024-11-12 01:07:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252276596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 01:07:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407532797] [2024-11-12 01:07:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 01:07:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:07:49,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 01:07:49,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-12 01:07:49,254 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:07:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:07:50,708 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2024-11-12 01:07:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 01:07:50,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-12 01:07:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:07:50,715 INFO L225 Difference]: With dead ends: 185 [2024-11-12 01:07:50,716 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 01:07:50,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:07:50,719 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:07:50,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:07:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 01:07:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2024-11-12 01:07:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 01:07:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-12 01:07:50,745 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 98 [2024-11-12 01:07:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:07:50,745 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-12 01:07:50,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:07:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-12 01:07:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 01:07:50,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:50,752 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:07:50,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1872370656, now seen corresponding path program 1 times [2024-11-12 01:07:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:07:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732407091] [2024-11-12 01:07:50,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:07:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:07:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:07:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:07:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:07:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:07:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:07:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:07:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:07:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:07:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:07:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:07:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:07:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:07:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:07:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:07:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:07:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:07:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732407091] [2024-11-12 01:07:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732407091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:07:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728125523] [2024-11-12 01:07:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:50,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:07:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:07:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:07:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:07:50,886 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:07:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:07:50,930 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2024-11-12 01:07:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:07:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-12 01:07:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:07:50,934 INFO L225 Difference]: With dead ends: 204 [2024-11-12 01:07:50,934 INFO L226 Difference]: Without dead ends: 143 [2024-11-12 01:07:50,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:07:50,936 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:07:50,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:07:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-12 01:07:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-12 01:07:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 01:07:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-12 01:07:50,975 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 98 [2024-11-12 01:07:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:07:50,976 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-12 01:07:50,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:07:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-12 01:07:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 01:07:50,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:50,981 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:50,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:07:50,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1561352705, now seen corresponding path program 1 times [2024-11-12 01:07:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:07:50,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596852501] [2024-11-12 01:07:50,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:07:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596852501] [2024-11-12 01:08:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596852501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:00,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:00,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 01:08:00,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386127546] [2024-11-12 01:08:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:00,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:08:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:08:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:08:00,724 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:07,862 INFO L93 Difference]: Finished difference Result 184 states and 256 transitions. [2024-11-12 01:08:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 01:08:07,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-12 01:08:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:07,865 INFO L225 Difference]: With dead ends: 184 [2024-11-12 01:08:07,865 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 01:08:07,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2024-11-12 01:08:07,868 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 96 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:07,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 328 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 01:08:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 01:08:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2024-11-12 01:08:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 01:08:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-12 01:08:07,905 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 99 [2024-11-12 01:08:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:07,905 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-12 01:08:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-12 01:08:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 01:08:07,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:07,910 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:07,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:08:07,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:07,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1134999740, now seen corresponding path program 1 times [2024-11-12 01:08:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865254107] [2024-11-12 01:08:07,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:11,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865254107] [2024-11-12 01:08:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865254107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:11,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 01:08:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401436459] [2024-11-12 01:08:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:08:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:08:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:08:11,532 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:13,529 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2024-11-12 01:08:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:08:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-12 01:08:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:13,533 INFO L225 Difference]: With dead ends: 189 [2024-11-12 01:08:13,533 INFO L226 Difference]: Without dead ends: 187 [2024-11-12 01:08:13,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:08:13,534 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 77 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:13,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 01:08:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-12 01:08:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-11-12 01:08:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 95 states have internal predecessors, (122), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 01:08:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2024-11-12 01:08:13,549 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 99 [2024-11-12 01:08:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:13,550 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2024-11-12 01:08:13,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2024-11-12 01:08:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 01:08:13,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:13,552 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:13,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:08:13,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1483073031, now seen corresponding path program 1 times [2024-11-12 01:08:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591394737] [2024-11-12 01:08:13,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:19,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591394737] [2024-11-12 01:08:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591394737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:19,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 01:08:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167418494] [2024-11-12 01:08:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:19,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:08:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:08:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:08:19,188 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:21,418 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2024-11-12 01:08:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 01:08:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-12 01:08:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:21,423 INFO L225 Difference]: With dead ends: 197 [2024-11-12 01:08:21,423 INFO L226 Difference]: Without dead ends: 195 [2024-11-12 01:08:21,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:08:21,424 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 92 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:21,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 266 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 01:08:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-12 01:08:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 154. [2024-11-12 01:08:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 01:08:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-12 01:08:21,444 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 99 [2024-11-12 01:08:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:21,445 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-12 01:08:21,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-12 01:08:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 01:08:21,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:21,447 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:21,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 01:08:21,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:21,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -726911460, now seen corresponding path program 1 times [2024-11-12 01:08:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:21,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121061341] [2024-11-12 01:08:21,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:21,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:21,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121061341] [2024-11-12 01:08:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121061341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:21,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:08:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288415385] [2024-11-12 01:08:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:08:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:08:21,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:08:21,618 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:21,710 INFO L93 Difference]: Finished difference Result 348 states and 505 transitions. [2024-11-12 01:08:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:08:21,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-12 01:08:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:21,714 INFO L225 Difference]: With dead ends: 348 [2024-11-12 01:08:21,715 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 01:08:21,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:08:21,717 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:21,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 210 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:08:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 01:08:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 205. [2024-11-12 01:08:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 140 states have internal predecessors, (180), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 01:08:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2024-11-12 01:08:21,735 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 99 [2024-11-12 01:08:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:21,735 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2024-11-12 01:08:21,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2024-11-12 01:08:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 01:08:21,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:21,738 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:21,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 01:08:21,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash -771751777, now seen corresponding path program 1 times [2024-11-12 01:08:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438152437] [2024-11-12 01:08:21,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438152437] [2024-11-12 01:08:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438152437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 01:08:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776420193] [2024-11-12 01:08:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:25,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 01:08:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 01:08:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-12 01:08:25,054 INFO L87 Difference]: Start difference. First operand 205 states and 300 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 01:08:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:27,217 INFO L93 Difference]: Finished difference Result 253 states and 355 transitions. [2024-11-12 01:08:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 01:08:27,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2024-11-12 01:08:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:27,220 INFO L225 Difference]: With dead ends: 253 [2024-11-12 01:08:27,220 INFO L226 Difference]: Without dead ends: 251 [2024-11-12 01:08:27,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-12 01:08:27,221 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 196 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 318 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 01:08:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-12 01:08:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 204. [2024-11-12 01:08:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 01:08:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2024-11-12 01:08:27,247 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 100 [2024-11-12 01:08:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:27,248 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2024-11-12 01:08:27,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 01:08:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2024-11-12 01:08:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 01:08:27,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:27,249 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:27,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 01:08:27,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:27,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1214027458, now seen corresponding path program 1 times [2024-11-12 01:08:27,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:27,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106072546] [2024-11-12 01:08:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:31,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:31,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106072546] [2024-11-12 01:08:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106072546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 01:08:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581900564] [2024-11-12 01:08:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:31,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 01:08:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 01:08:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:08:31,230 INFO L87 Difference]: Start difference. First operand 204 states and 298 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:35,063 INFO L93 Difference]: Finished difference Result 273 states and 378 transitions. [2024-11-12 01:08:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:08:35,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-12 01:08:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:35,068 INFO L225 Difference]: With dead ends: 273 [2024-11-12 01:08:35,068 INFO L226 Difference]: Without dead ends: 271 [2024-11-12 01:08:35,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:08:35,069 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 75 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:35,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 329 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 01:08:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-12 01:08:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 206. [2024-11-12 01:08:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 01:08:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 300 transitions. [2024-11-12 01:08:35,090 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 300 transitions. Word has length 100 [2024-11-12 01:08:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:35,090 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 300 transitions. [2024-11-12 01:08:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 01:08:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 300 transitions. [2024-11-12 01:08:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 01:08:35,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:35,092 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:35,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 01:08:35,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:35,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash 382740351, now seen corresponding path program 1 times [2024-11-12 01:08:35,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:35,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417635094] [2024-11-12 01:08:35,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:39,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:39,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417635094] [2024-11-12 01:08:39,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417635094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:39,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:39,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 01:08:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864840875] [2024-11-12 01:08:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:39,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 01:08:39,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:39,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 01:08:39,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-12 01:08:39,158 INFO L87 Difference]: Start difference. First operand 206 states and 300 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 01:08:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:43,460 INFO L93 Difference]: Finished difference Result 305 states and 417 transitions. [2024-11-12 01:08:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 01:08:43,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2024-11-12 01:08:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:43,463 INFO L225 Difference]: With dead ends: 305 [2024-11-12 01:08:43,463 INFO L226 Difference]: Without dead ends: 303 [2024-11-12 01:08:43,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-12 01:08:43,465 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 247 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:43,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 238 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-12 01:08:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-12 01:08:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 214. [2024-11-12 01:08:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 149 states have internal predecessors, (192), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 01:08:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 312 transitions. [2024-11-12 01:08:43,489 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 312 transitions. Word has length 100 [2024-11-12 01:08:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 312 transitions. [2024-11-12 01:08:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 01:08:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 312 transitions. [2024-11-12 01:08:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 01:08:43,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:43,494 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:43,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 01:08:43,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:43,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1062798721, now seen corresponding path program 1 times [2024-11-12 01:08:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194435447] [2024-11-12 01:08:43,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:08:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:08:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:08:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:08:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:08:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:08:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:08:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:08:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:08:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:08:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 01:08:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:49,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194435447] [2024-11-12 01:08:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194435447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:49,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 01:08:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333179732] [2024-11-12 01:08:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:49,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 01:08:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 01:08:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-12 01:08:49,735 INFO L87 Difference]: Start difference. First operand 214 states and 312 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 01:08:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:56,988 INFO L93 Difference]: Finished difference Result 287 states and 396 transitions. [2024-11-12 01:08:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 01:08:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2024-11-12 01:08:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:56,992 INFO L225 Difference]: With dead ends: 287 [2024-11-12 01:08:56,992 INFO L226 Difference]: Without dead ends: 285 [2024-11-12 01:08:56,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-12 01:08:56,993 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 191 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:56,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 233 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-12 01:08:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-12 01:08:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 210. [2024-11-12 01:08:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 01:08:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2024-11-12 01:08:57,017 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 100 [2024-11-12 01:08:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:57,018 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2024-11-12 01:08:57,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 01:08:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2024-11-12 01:08:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 01:08:57,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:57,019 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:08:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 01:08:57,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -826031221, now seen corresponding path program 1 times [2024-11-12 01:08:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528952303] [2024-11-12 01:08:57,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat