./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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.dd.update-z3-fca748b-m [2024-11-20 02:21:00,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:21:00,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:21:00,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:21:00,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:21:01,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:21:01,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:21:01,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:21:01,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:21:01,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:21:01,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:21:01,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:21:01,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:21:01,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:21:01,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:21:01,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:21:01,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:21:01,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:21:01,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:21:01,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:21:01,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:21:01,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:21:01,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:21:01,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:21:01,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:21:01,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:21:01,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:21:01,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:21:01,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:21:01,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:21:01,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:21:01,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:21:01,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:01,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:21:01,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:21:01,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:21:01,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:21:01,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:21:01,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:21:01,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:21:01,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:21:01,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:21:01,029 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-20 02:21:01,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:21:01,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:21:01,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:21:01,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:21:01,296 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:21:01,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-11-20 02:21:02,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:21:02,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:21:02,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-11-20 02:21:02,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3bea0683/cee657ef9cc44ebba7ac3cfe03377135/FLAG47b0b79c5 [2024-11-20 02:21:03,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3bea0683/cee657ef9cc44ebba7ac3cfe03377135 [2024-11-20 02:21:03,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:21:03,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:21:03,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:03,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:21:03,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:21:03,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eae8e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03, skipping insertion in model container [2024-11-20 02:21:03,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:21:03,490 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-20 02:21:03,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:03,564 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:21:03,591 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-20 02:21:03,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:03,642 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:21:03,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03 WrapperNode [2024-11-20 02:21:03,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:03,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:03,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:21:03,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:21:03,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,696 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-20 02:21:03,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:03,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:21:03,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:21:03,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:21:03,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,737 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-20 02:21:03,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:21:03,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:21:03,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:21:03,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:21:03,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (1/1) ... [2024-11-20 02:21:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:03,819 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-20 02:21:03,827 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-20 02:21:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:21:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:21:03,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:21:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:21:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:21:03,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:21:03,925 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:21:03,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:21:04,232 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:21:04,232 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:21:04,247 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:21:04,247 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:21:04,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:04 BoogieIcfgContainer [2024-11-20 02:21:04,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:21:04,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:21:04,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:21:04,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:21:04,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:21:03" (1/3) ... [2024-11-20 02:21:04,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c92b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:04, skipping insertion in model container [2024-11-20 02:21:04,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:03" (2/3) ... [2024-11-20 02:21:04,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c92b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:04, skipping insertion in model container [2024-11-20 02:21:04,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:04" (3/3) ... [2024-11-20 02:21:04,259 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2024-11-20 02:21:04,276 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:21:04,277 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:21:04,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:21:04,350 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;@65b8780a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:21:04,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:21:04,354 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-20 02:21:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:21:04,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:04,363 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:04,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:04,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2100497442, now seen corresponding path program 1 times [2024-11-20 02:21:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:04,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703507765] [2024-11-20 02:21:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,755 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-20 02:21:04,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703507765] [2024-11-20 02:21:04,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703507765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:04,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:04,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:21:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339920866] [2024-11-20 02:21:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:04,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:21:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:21:04,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:21:04,791 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-20 02:21:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:04,816 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2024-11-20 02:21:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:21:04,820 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-20 02:21:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:04,830 INFO L225 Difference]: With dead ends: 97 [2024-11-20 02:21:04,830 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 02:21:04,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:21:04,837 INFO L432 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-20 02:21:04,838 INFO L433 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-20 02:21:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 02:21:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-20 02:21:04,871 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-20 02:21:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-20 02:21:04,874 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 98 [2024-11-20 02:21:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:04,875 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-20 02:21:04,875 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-20 02:21:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-20 02:21:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:21:04,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:04,880 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:04,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:21:04,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:04,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1585339296, now seen corresponding path program 1 times [2024-11-20 02:21:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365525324] [2024-11-20 02:21:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,364 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-20 02:21:05,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365525324] [2024-11-20 02:21:05,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365525324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:05,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:05,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:21:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101191477] [2024-11-20 02:21:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:05,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:21:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:05,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:21:05,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:21:05,378 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-20 02:21:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:05,600 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-20 02:21:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:21:05,602 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-20 02:21:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:05,605 INFO L225 Difference]: With dead ends: 139 [2024-11-20 02:21:05,606 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 02:21:05,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:21:05,609 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:05,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 191 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 02:21:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-20 02:21:05,638 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-20 02:21:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-20 02:21:05,643 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 98 [2024-11-20 02:21:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:05,644 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-20 02:21:05,645 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-20 02:21:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-20 02:21:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:21:05,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:05,647 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:05,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:21:05,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2029569630, now seen corresponding path program 1 times [2024-11-20 02:21:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248924895] [2024-11-20 02:21:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,011 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-20 02:21:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248924895] [2024-11-20 02:21:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248924895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:10,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:10,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:21:10,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466674292] [2024-11-20 02:21:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:10,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:21:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:21:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:21:10,019 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-20 02:21:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:10,817 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2024-11-20 02:21:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 02:21:10,820 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-20 02:21:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:10,822 INFO L225 Difference]: With dead ends: 185 [2024-11-20 02:21:10,822 INFO L226 Difference]: Without dead ends: 140 [2024-11-20 02:21:10,823 INFO L431 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-20 02:21:10,827 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:10,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:21:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-20 02:21:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2024-11-20 02:21:10,850 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-20 02:21:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-20 02:21:10,852 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 98 [2024-11-20 02:21:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:10,853 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-20 02:21:10,853 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-20 02:21:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-20 02:21:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:21:10,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:10,855 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:10,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:21:10,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1872370656, now seen corresponding path program 1 times [2024-11-20 02:21:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605656663] [2024-11-20 02:21:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:10,951 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-20 02:21:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:10,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605656663] [2024-11-20 02:21:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605656663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:21:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994494257] [2024-11-20 02:21:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:10,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:21:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:21:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:10,953 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-20 02:21:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:10,990 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2024-11-20 02:21:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:21:10,991 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-20 02:21:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:10,992 INFO L225 Difference]: With dead ends: 204 [2024-11-20 02:21:10,992 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 02:21:10,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:10,994 INFO L432 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-20 02:21:10,995 INFO L433 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-20 02:21:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 02:21:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-20 02:21:11,009 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-20 02:21:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-20 02:21:11,011 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 98 [2024-11-20 02:21:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:11,011 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-20 02:21:11,012 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-20 02:21:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-20 02:21:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 02:21:11,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:11,013 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:11,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:21:11,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1561352705, now seen corresponding path program 1 times [2024-11-20 02:21:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823946560] [2024-11-20 02:21:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,364 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-20 02:21:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823946560] [2024-11-20 02:21:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823946560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:19,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:19,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:21:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845103486] [2024-11-20 02:21:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:19,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:21:19,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:21:19,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:21:19,367 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-20 02:21:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:24,989 INFO L93 Difference]: Finished difference Result 184 states and 256 transitions. [2024-11-20 02:21:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 02:21:24,990 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-20 02:21:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:24,991 INFO L225 Difference]: With dead ends: 184 [2024-11-20 02:21:24,992 INFO L226 Difference]: Without dead ends: 182 [2024-11-20 02:21:24,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2024-11-20 02:21:24,993 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 96 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:24,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 328 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 02:21:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-20 02:21:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2024-11-20 02:21:25,026 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-20 02:21:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-20 02:21:25,028 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 99 [2024-11-20 02:21:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:25,030 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-20 02:21:25,031 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-20 02:21:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-20 02:21:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 02:21:25,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:25,032 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:25,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:21:25,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:25,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1134999740, now seen corresponding path program 1 times [2024-11-20 02:21:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528133233] [2024-11-20 02:21:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:28,369 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-20 02:21:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528133233] [2024-11-20 02:21:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528133233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:21:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033338894] [2024-11-20 02:21:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:28,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:21:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:28,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:21:28,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:21:28,372 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-20 02:21:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:30,661 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2024-11-20 02:21:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:21:30,662 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-20 02:21:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:30,664 INFO L225 Difference]: With dead ends: 189 [2024-11-20 02:21:30,665 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 02:21:30,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:21:30,667 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 77 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:30,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 02:21:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 02:21:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-11-20 02:21:30,688 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-20 02:21:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2024-11-20 02:21:30,692 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 99 [2024-11-20 02:21:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:30,693 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2024-11-20 02:21:30,693 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-20 02:21:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2024-11-20 02:21:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 02:21:30,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:30,694 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:30,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:21:30,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1483073031, now seen corresponding path program 1 times [2024-11-20 02:21:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:30,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497457281] [2024-11-20 02:21:30,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:37,694 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-20 02:21:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497457281] [2024-11-20 02:21:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497457281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:21:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108882447] [2024-11-20 02:21:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:21:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:37,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:21:37,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:21:37,696 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-20 02:21:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:40,330 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2024-11-20 02:21:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 02:21:40,331 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-20 02:21:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:40,333 INFO L225 Difference]: With dead ends: 197 [2024-11-20 02:21:40,333 INFO L226 Difference]: Without dead ends: 195 [2024-11-20 02:21:40,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-20 02:21:40,335 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 92 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:40,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 266 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 02:21:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-20 02:21:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 154. [2024-11-20 02:21:40,354 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-20 02:21:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-20 02:21:40,357 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 99 [2024-11-20 02:21:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-20 02:21:40,360 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-20 02:21:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-20 02:21:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 02:21:40,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:40,363 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:40,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:21:40,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:40,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -726911460, now seen corresponding path program 1 times [2024-11-20 02:21:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:40,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659096404] [2024-11-20 02:21:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:40,510 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-20 02:21:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659096404] [2024-11-20 02:21:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659096404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:40,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:40,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:21:40,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525900924] [2024-11-20 02:21:40,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:40,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:21:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:40,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:21:40,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:21:40,513 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-20 02:21:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:40,592 INFO L93 Difference]: Finished difference Result 348 states and 505 transitions. [2024-11-20 02:21:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:21:40,592 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-20 02:21:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:40,594 INFO L225 Difference]: With dead ends: 348 [2024-11-20 02:21:40,594 INFO L226 Difference]: Without dead ends: 231 [2024-11-20 02:21:40,595 INFO L431 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-20 02:21:40,596 INFO L432 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-20 02:21:40,596 INFO L433 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-20 02:21:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-20 02:21:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 205. [2024-11-20 02:21:40,614 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-20 02:21:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2024-11-20 02:21:40,617 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 99 [2024-11-20 02:21:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:40,617 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2024-11-20 02:21:40,617 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-20 02:21:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2024-11-20 02:21:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 02:21:40,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:40,619 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:21:40,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -771751777, now seen corresponding path program 1 times [2024-11-20 02:21:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24071782] [2024-11-20 02:21:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:43,912 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-20 02:21:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24071782] [2024-11-20 02:21:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24071782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:43,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:43,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 02:21:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108663689] [2024-11-20 02:21:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:21:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:21:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:21:43,915 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-20 02:21:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:46,297 INFO L93 Difference]: Finished difference Result 253 states and 355 transitions. [2024-11-20 02:21:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:21:46,297 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-20 02:21:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:46,299 INFO L225 Difference]: With dead ends: 253 [2024-11-20 02:21:46,299 INFO L226 Difference]: Without dead ends: 251 [2024-11-20 02:21:46,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-20 02:21:46,300 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 196 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:46,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 318 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 02:21:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-20 02:21:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 204. [2024-11-20 02:21:46,321 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-20 02:21:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2024-11-20 02:21:46,322 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 100 [2024-11-20 02:21:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:46,323 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2024-11-20 02:21:46,323 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-20 02:21:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2024-11-20 02:21:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 02:21:46,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:46,324 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:46,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:21:46,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:46,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1214027458, now seen corresponding path program 1 times [2024-11-20 02:21:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802276100] [2024-11-20 02:21:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:50,214 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-20 02:21:50,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:50,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802276100] [2024-11-20 02:21:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802276100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 02:21:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357688024] [2024-11-20 02:21:50,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:50,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 02:21:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 02:21:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:21:50,216 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-20 02:21:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:55,358 INFO L93 Difference]: Finished difference Result 273 states and 378 transitions. [2024-11-20 02:21:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:21:55,359 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-20 02:21:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:55,361 INFO L225 Difference]: With dead ends: 273 [2024-11-20 02:21:55,361 INFO L226 Difference]: Without dead ends: 271 [2024-11-20 02:21:55,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:21:55,362 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 75 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:55,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 329 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 02:21:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-20 02:21:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 206. [2024-11-20 02:21:55,384 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-20 02:21:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 300 transitions. [2024-11-20 02:21:55,386 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 300 transitions. Word has length 100 [2024-11-20 02:21:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:55,386 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 300 transitions. [2024-11-20 02:21:55,387 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-20 02:21:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 300 transitions. [2024-11-20 02:21:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 02:21:55,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:55,388 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:21:55,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:55,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 382740351, now seen corresponding path program 1 times [2024-11-20 02:21:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:55,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746547330] [2024-11-20 02:21:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:21:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:21:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:21:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:21:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:59,118 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-20 02:21:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746547330] [2024-11-20 02:21:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746547330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:59,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:59,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 02:21:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454610793] [2024-11-20 02:21:59,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:59,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:21:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:21:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:21:59,121 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-20 02:22:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:22:03,608 INFO L93 Difference]: Finished difference Result 305 states and 417 transitions. [2024-11-20 02:22:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:22:03,610 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-20 02:22:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:22:03,611 INFO L225 Difference]: With dead ends: 305 [2024-11-20 02:22:03,612 INFO L226 Difference]: Without dead ends: 303 [2024-11-20 02:22:03,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-20 02:22:03,612 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 247 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:22:03,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 238 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 02:22:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-20 02:22:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 214. [2024-11-20 02:22:03,631 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-20 02:22:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 312 transitions. [2024-11-20 02:22:03,632 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 312 transitions. Word has length 100 [2024-11-20 02:22:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:22:03,633 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 312 transitions. [2024-11-20 02:22:03,633 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-20 02:22:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 312 transitions. [2024-11-20 02:22:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 02:22:03,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:22:03,634 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:22:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:22:03,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:22:03,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:22:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1062798721, now seen corresponding path program 1 times [2024-11-20 02:22:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:22:03,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931490828] [2024-11-20 02:22:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:22:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:22:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:22:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:22:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:22:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:22:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:22:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:22:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:22:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:22:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:22:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:22:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:22:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:22:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:22:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:22:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:22:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:11,812 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-20 02:22:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:22:11,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931490828] [2024-11-20 02:22:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931490828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:22:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:22:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 02:22:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838372625] [2024-11-20 02:22:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:22:11,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:22:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:22:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:22:11,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:22:11,815 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-20 02:22:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:22:20,443 INFO L93 Difference]: Finished difference Result 287 states and 396 transitions. [2024-11-20 02:22:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:22:20,444 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-20 02:22:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:22:20,446 INFO L225 Difference]: With dead ends: 287 [2024-11-20 02:22:20,446 INFO L226 Difference]: Without dead ends: 285 [2024-11-20 02:22:20,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-20 02:22:20,447 INFO L432 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-20 02:22:20,447 INFO L433 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-20 02:22:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-20 02:22:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 210. [2024-11-20 02:22:20,467 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-20 02:22:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2024-11-20 02:22:20,468 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 100 [2024-11-20 02:22:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:22:20,469 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2024-11-20 02:22:20,469 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-20 02:22:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2024-11-20 02:22:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 02:22:20,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:22:20,470 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:22:20,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 02:22:20,471 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:22:20,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:22:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -826031221, now seen corresponding path program 1 times [2024-11-20 02:22:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:22:20,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656882960] [2024-11-20 02:22:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:22:20,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:22:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:22:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:22:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:22:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:22:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:22:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:22:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:22:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:22:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:22:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:22:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:22:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:22:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:22:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:22:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:22:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:22:26,239 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-20 02:22:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:22:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656882960] [2024-11-20 02:22:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656882960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:22:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:22:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 02:22:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392678969] [2024-11-20 02:22:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:22:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 02:22:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:22:26,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 02:22:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:22:26,242 INFO L87 Difference]: Start difference. First operand 210 states and 306 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)