./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4494aec82e3354bd32c6c13af5c36deffc5336d06a7a21928d54585f4657c423 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:17:30,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:17:30,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:17:30,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:17:30,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:17:30,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:17:30,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:17:30,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:17:30,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:17:30,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:17:30,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:17:30,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:17:30,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:17:30,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:17:30,483 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:17:30,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:17:30,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:17:30,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:17:30,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:17:30,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:17:30,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:17:30,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:17:30,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:17:30,487 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4494aec82e3354bd32c6c13af5c36deffc5336d06a7a21928d54585f4657c423 [2025-02-05 21:17:30,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:17:30,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:17:30,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:17:30,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:17:30,808 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:17:30,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-02-05 21:17:32,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5482b55/c5a775015032416a9e28380f2483163a/FLAG57c411f4d [2025-02-05 21:17:32,531 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:17:32,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-02-05 21:17:32,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5482b55/c5a775015032416a9e28380f2483163a/FLAG57c411f4d [2025-02-05 21:17:32,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5482b55/c5a775015032416a9e28380f2483163a [2025-02-05 21:17:32,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:17:32,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:17:32,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:17:32,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:17:32,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:17:32,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:32,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355f132f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32, skipping insertion in model container [2025-02-05 21:17:32,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:32,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:17:32,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i[916,929] [2025-02-05 21:17:32,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:17:32,830 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:17:32,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i[916,929] [2025-02-05 21:17:32,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:17:32,912 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:17:32,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32 WrapperNode [2025-02-05 21:17:32,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:17:32,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:17:32,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:17:32,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:17:32,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:32,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:32,978 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 306 [2025-02-05 21:17:32,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:17:32,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:17:32,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:17:32,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:17:32,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:32,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,035 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]. [2025-02-05 21:17:33,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:17:33,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:17:33,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:17:33,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:17:33,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (1/1) ... [2025-02-05 21:17:33,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:17:33,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:17:33,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:17:33,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:17:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:17:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:17:33,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:17:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:17:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:17:33,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:17:33,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:17:33,235 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:17:33,801 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 21:17:33,802 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:17:33,825 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:17:33,829 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:17:33,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:17:33 BoogieIcfgContainer [2025-02-05 21:17:33,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:17:33,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:17:33,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:17:33,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:17:33,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:17:32" (1/3) ... [2025-02-05 21:17:33,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af0ec87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:17:33, skipping insertion in model container [2025-02-05 21:17:33,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:17:32" (2/3) ... [2025-02-05 21:17:33,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af0ec87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:17:33, skipping insertion in model container [2025-02-05 21:17:33,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:17:33" (3/3) ... [2025-02-05 21:17:33,840 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-02-05 21:17:33,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:17:33,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-86.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:17:33,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:17:33,918 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;@17622a08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:17:33,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:17:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-05 21:17:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 21:17:33,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:17:33,940 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:17:33,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:17:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:17:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1004890021, now seen corresponding path program 1 times [2025-02-05 21:17:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:17:33,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662681750] [2025-02-05 21:17:33,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:17:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:17:34,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 21:17:34,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 21:17:34,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:17:34,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:17:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:17:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:17:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662681750] [2025-02-05 21:17:34,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662681750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:17:34,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:17:34,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:17:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192875591] [2025-02-05 21:17:34,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:17:34,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:17:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:17:34,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:17:34,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:17:34,926 INFO L87 Difference]: Start difference. First operand has 133 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:17:35,452 INFO L93 Difference]: Finished difference Result 388 states and 726 transitions. [2025-02-05 21:17:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:17:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 270 [2025-02-05 21:17:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:17:35,470 INFO L225 Difference]: With dead ends: 388 [2025-02-05 21:17:35,471 INFO L226 Difference]: Without dead ends: 258 [2025-02-05 21:17:35,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:17:35,482 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 192 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:17:35,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 703 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:17:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-05 21:17:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2025-02-05 21:17:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 149 states have (on average 1.4228187919463087) internal successors, (212), 149 states have internal predecessors, (212), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:17:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 384 transitions. [2025-02-05 21:17:35,592 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 384 transitions. Word has length 270 [2025-02-05 21:17:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:17:35,595 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 384 transitions. [2025-02-05 21:17:35,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 384 transitions. [2025-02-05 21:17:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 21:17:35,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:17:35,600 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:17:35,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 21:17:35,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:17:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:17:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 499331396, now seen corresponding path program 1 times [2025-02-05 21:17:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:17:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612788527] [2025-02-05 21:17:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:17:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:17:35,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 21:17:35,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 21:17:35,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:17:35,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:17:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:17:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:17:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612788527] [2025-02-05 21:17:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612788527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:17:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:17:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:17:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502472705] [2025-02-05 21:17:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:17:42,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:17:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:17:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:17:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:17:42,052 INFO L87 Difference]: Start difference. First operand 238 states and 384 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:17:43,591 INFO L93 Difference]: Finished difference Result 441 states and 695 transitions. [2025-02-05 21:17:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:17:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 270 [2025-02-05 21:17:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:17:43,596 INFO L225 Difference]: With dead ends: 441 [2025-02-05 21:17:43,596 INFO L226 Difference]: Without dead ends: 314 [2025-02-05 21:17:43,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:17:43,598 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 448 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:17:43,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1297 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:17:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-05 21:17:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 255. [2025-02-05 21:17:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 166 states have (on average 1.4156626506024097) internal successors, (235), 166 states have internal predecessors, (235), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-05 21:17:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 407 transitions. [2025-02-05 21:17:43,637 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 407 transitions. Word has length 270 [2025-02-05 21:17:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:17:43,638 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 407 transitions. [2025-02-05 21:17:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 407 transitions. [2025-02-05 21:17:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-05 21:17:43,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:17:43,642 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:17:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:17:43,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:17:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:17:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1297619963, now seen corresponding path program 1 times [2025-02-05 21:17:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:17:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732851772] [2025-02-05 21:17:43,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:17:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:17:43,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-05 21:17:43,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-05 21:17:43,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:17:43,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:17:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:17:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:17:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732851772] [2025-02-05 21:17:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732851772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:17:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:17:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:17:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103592899] [2025-02-05 21:17:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:17:43,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:17:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:17:43,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:17:43,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:17:43,804 INFO L87 Difference]: Start difference. First operand 255 states and 407 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:17:43,880 INFO L93 Difference]: Finished difference Result 508 states and 815 transitions. [2025-02-05 21:17:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:17:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 270 [2025-02-05 21:17:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:17:43,885 INFO L225 Difference]: With dead ends: 508 [2025-02-05 21:17:43,886 INFO L226 Difference]: Without dead ends: 381 [2025-02-05 21:17:43,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:17:43,887 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 200 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:17:43,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 410 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:17:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-05 21:17:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2025-02-05 21:17:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 246 states have (on average 1.4146341463414633) internal successors, (348), 246 states have internal predecessors, (348), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:17:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 606 transitions. [2025-02-05 21:17:43,967 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 606 transitions. Word has length 270 [2025-02-05 21:17:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:17:43,968 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 606 transitions. [2025-02-05 21:17:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 606 transitions. [2025-02-05 21:17:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 21:17:43,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:17:43,973 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:17:43,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:17:43,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:17:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:17:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1612799872, now seen corresponding path program 1 times [2025-02-05 21:17:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:17:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123459741] [2025-02-05 21:17:43,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:17:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:17:43,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 21:17:44,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 21:17:44,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:17:44,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:17:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:17:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:17:48,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123459741] [2025-02-05 21:17:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123459741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:17:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:17:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:17:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559298760] [2025-02-05 21:17:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:17:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:17:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:17:48,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:17:48,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:17:48,835 INFO L87 Difference]: Start difference. First operand 379 states and 606 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:17:50,231 INFO L93 Difference]: Finished difference Result 429 states and 664 transitions. [2025-02-05 21:17:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:17:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-02-05 21:17:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:17:50,236 INFO L225 Difference]: With dead ends: 429 [2025-02-05 21:17:50,236 INFO L226 Difference]: Without dead ends: 427 [2025-02-05 21:17:50,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:17:50,239 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 317 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:17:50,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1488 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:17:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-05 21:17:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 380. [2025-02-05 21:17:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 247 states have (on average 1.4129554655870444) internal successors, (349), 247 states have internal predecessors, (349), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:17:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 607 transitions. [2025-02-05 21:17:50,307 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 607 transitions. Word has length 271 [2025-02-05 21:17:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:17:50,311 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 607 transitions. [2025-02-05 21:17:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 607 transitions. [2025-02-05 21:17:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 21:17:50,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:17:50,315 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:17:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:17:50,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:17:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:17:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1123376829, now seen corresponding path program 1 times [2025-02-05 21:17:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:17:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423515614] [2025-02-05 21:17:50,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:17:50,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:17:50,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 21:17:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 21:17:50,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:17:50,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:17:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:17:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:17:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423515614] [2025-02-05 21:17:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423515614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:17:50,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:17:50,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:17:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046116627] [2025-02-05 21:17:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:17:50,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:17:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:17:50,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:17:50,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:17:50,576 INFO L87 Difference]: Start difference. First operand 380 states and 607 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:17:50,615 INFO L93 Difference]: Finished difference Result 642 states and 1026 transitions. [2025-02-05 21:17:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:17:50,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-02-05 21:17:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:17:50,621 INFO L225 Difference]: With dead ends: 642 [2025-02-05 21:17:50,621 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 21:17:50,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:17:50,624 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 6 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:17:50,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 398 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:17:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 21:17:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2025-02-05 21:17:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 247 states have (on average 1.4008097165991902) internal successors, (346), 247 states have internal predecessors, (346), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:17:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 604 transitions. [2025-02-05 21:17:50,687 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 604 transitions. Word has length 271 [2025-02-05 21:17:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:17:50,688 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 604 transitions. [2025-02-05 21:17:50,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:17:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 604 transitions. [2025-02-05 21:17:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 21:17:50,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:17:50,694 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:17:50,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:17:50,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:17:50,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:17:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2010880510, now seen corresponding path program 1 times [2025-02-05 21:17:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:17:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565460445] [2025-02-05 21:17:50,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:17:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:17:50,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 21:17:50,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 21:17:50,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:17:50,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:17:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:17:57,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:17:57,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565460445] [2025-02-05 21:17:57,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565460445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:17:57,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:17:57,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 21:17:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393316354] [2025-02-05 21:17:57,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:17:57,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:17:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:17:57,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:17:57,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:17:57,554 INFO L87 Difference]: Start difference. First operand 380 states and 604 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-05 21:18:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:18:00,471 INFO L93 Difference]: Finished difference Result 433 states and 662 transitions. [2025-02-05 21:18:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:18:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 271 [2025-02-05 21:18:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:18:00,477 INFO L225 Difference]: With dead ends: 433 [2025-02-05 21:18:00,477 INFO L226 Difference]: Without dead ends: 431 [2025-02-05 21:18:00,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2025-02-05 21:18:00,480 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 462 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:18:00,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1636 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:18:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-05 21:18:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 384. [2025-02-05 21:18:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 250 states have (on average 1.396) internal successors, (349), 250 states have internal predecessors, (349), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:18:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2025-02-05 21:18:00,527 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 271 [2025-02-05 21:18:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:18:00,528 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2025-02-05 21:18:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-05 21:18:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2025-02-05 21:18:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 21:18:00,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:18:00,533 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:18:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:18:00,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:18:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:18:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 496825244, now seen corresponding path program 1 times [2025-02-05 21:18:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:18:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680640231] [2025-02-05 21:18:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:18:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:18:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 21:18:00,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 21:18:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:18:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:18:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:18:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:18:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680640231] [2025-02-05 21:18:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680640231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:18:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:18:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:18:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486086497] [2025-02-05 21:18:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:18:05,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:18:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:18:05,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:18:05,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:18:05,183 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:18:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:18:07,007 INFO L93 Difference]: Finished difference Result 454 states and 686 transitions. [2025-02-05 21:18:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:18:07,008 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-02-05 21:18:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:18:07,014 INFO L225 Difference]: With dead ends: 454 [2025-02-05 21:18:07,015 INFO L226 Difference]: Without dead ends: 452 [2025-02-05 21:18:07,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:18:07,017 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 441 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:18:07,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1204 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:18:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-05 21:18:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 394. [2025-02-05 21:18:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 260 states have (on average 1.3923076923076922) internal successors, (362), 260 states have internal predecessors, (362), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:18:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2025-02-05 21:18:07,071 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 271 [2025-02-05 21:18:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:18:07,071 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2025-02-05 21:18:07,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:18:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2025-02-05 21:18:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 21:18:07,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:18:07,078 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:18:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:18:07,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:18:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:18:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1310629219, now seen corresponding path program 1 times [2025-02-05 21:18:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:18:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400448766] [2025-02-05 21:18:07,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:18:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:18:07,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 21:18:07,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 21:18:07,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:18:07,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:18:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:18:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:18:11,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400448766] [2025-02-05 21:18:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400448766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:18:11,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:18:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:18:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641729628] [2025-02-05 21:18:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:18:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:18:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:18:11,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:18:11,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:18:11,285 INFO L87 Difference]: Start difference. First operand 394 states and 620 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:18:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:18:13,183 INFO L93 Difference]: Finished difference Result 448 states and 680 transitions. [2025-02-05 21:18:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:18:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 271 [2025-02-05 21:18:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:18:13,187 INFO L225 Difference]: With dead ends: 448 [2025-02-05 21:18:13,187 INFO L226 Difference]: Without dead ends: 446 [2025-02-05 21:18:13,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2025-02-05 21:18:13,188 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 443 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:18:13,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1210 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:18:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-02-05 21:18:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 394. [2025-02-05 21:18:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 260 states have (on average 1.3923076923076922) internal successors, (362), 260 states have internal predecessors, (362), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:18:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2025-02-05 21:18:13,227 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 271 [2025-02-05 21:18:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:18:13,227 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2025-02-05 21:18:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-05 21:18:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2025-02-05 21:18:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 21:18:13,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:18:13,230 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:18:13,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:18:13,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:18:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:18:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1737143582, now seen corresponding path program 1 times [2025-02-05 21:18:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:18:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44212836] [2025-02-05 21:18:13,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:18:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:18:13,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 21:18:13,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 21:18:13,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:18:13,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:18:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:18:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:18:22,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44212836] [2025-02-05 21:18:22,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44212836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:18:22,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:18:22,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 21:18:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045103609] [2025-02-05 21:18:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:18:22,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 21:18:22,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:18:22,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 21:18:22,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:18:22,605 INFO L87 Difference]: Start difference. First operand 394 states and 620 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-05 21:18:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:18:30,691 INFO L93 Difference]: Finished difference Result 457 states and 691 transitions. [2025-02-05 21:18:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:18:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 272 [2025-02-05 21:18:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:18:30,696 INFO L225 Difference]: With dead ends: 457 [2025-02-05 21:18:30,696 INFO L226 Difference]: Without dead ends: 455 [2025-02-05 21:18:30,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 21:18:30,698 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 402 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:18:30,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1638 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 21:18:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-05 21:18:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 398. [2025-02-05 21:18:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 264 states have (on average 1.3901515151515151) internal successors, (367), 264 states have internal predecessors, (367), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-02-05 21:18:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 625 transitions. [2025-02-05 21:18:30,740 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 625 transitions. Word has length 272 [2025-02-05 21:18:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:18:30,740 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 625 transitions. [2025-02-05 21:18:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-05 21:18:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 625 transitions. [2025-02-05 21:18:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 21:18:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:18:30,743 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:18:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:18:30,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:18:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:18:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 750369251, now seen corresponding path program 1 times [2025-02-05 21:18:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:18:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614038808] [2025-02-05 21:18:30,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:18:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:18:30,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 21:18:30,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 21:18:30,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:18:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:18:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-05 21:18:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:18:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614038808] [2025-02-05 21:18:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614038808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:18:44,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:18:44,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 21:18:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672710859] [2025-02-05 21:18:44,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:18:44,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:18:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:18:44,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:18:44,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:18:44,253 INFO L87 Difference]: Start difference. First operand 398 states and 625 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43)