./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-88.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 483b9d73fcfcbe30e6a47224b392863d5ebfca3910dfd0deef6d7653b488cd58 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:48:46,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:48:46,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:48:46,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:48:46,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:48:46,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:48:46,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:48:46,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:48:46,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:48:46,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:48:46,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:48:46,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:48:46,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:48:46,272 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:46,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:48:46,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:48:46,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:48:46,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:48:46,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:48:46,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:48:46,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:48:46,273 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/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 -> 483b9d73fcfcbe30e6a47224b392863d5ebfca3910dfd0deef6d7653b488cd58 [2025-03-08 15:48:46,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:48:46,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:48:46,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:48:46,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:48:46,519 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:48:46,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-88.i [2025-03-08 15:48:47,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf75a83f/ef811ad6bf754d8b8def8ee64991c811/FLAG377a3324e [2025-03-08 15:48:47,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:48:47,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-88.i [2025-03-08 15:48:47,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf75a83f/ef811ad6bf754d8b8def8ee64991c811/FLAG377a3324e [2025-03-08 15:48:48,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf75a83f/ef811ad6bf754d8b8def8ee64991c811 [2025-03-08 15:48:48,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:48:48,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:48:48,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:48,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:48:48,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:48:48,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48, skipping insertion in model container [2025-03-08 15:48:48,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:48:48,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-88.i[916,929] [2025-03-08 15:48:48,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:48,376 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:48:48,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-88.i[916,929] [2025-03-08 15:48:48,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:48,501 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:48:48,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48 WrapperNode [2025-03-08 15:48:48,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:48,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:48,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:48:48,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:48:48,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,627 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 757 [2025-03-08 15:48:48,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:48,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:48:48,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:48:48,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:48:48,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,730 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-03-08 15:48:48,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:48:48,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:48:48,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:48:48,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:48:48,786 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (1/1) ... [2025-03-08 15:48:48,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:48,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:48:48,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:48:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:48:48,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:48:48,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:48:48,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:48:48,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:48:48,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:48:48,945 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:48:48,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:48:49,892 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L636: havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~ite52#1;havoc property_#t~bitwise50#1;havoc property_#t~bitwise51#1;havoc property_#t~short53#1;havoc property_#t~ite59#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~ite56#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~short60#1;havoc property_#t~bitwise61#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~bitwise65#1;havoc property_#t~short66#1; [2025-03-08 15:48:50,061 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-08 15:48:50,061 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:48:50,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:48:50,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:48:50,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:50 BoogieIcfgContainer [2025-03-08 15:48:50,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:48:50,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:48:50,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:48:50,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:48:50,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:48:48" (1/3) ... [2025-03-08 15:48:50,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b0e9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:50, skipping insertion in model container [2025-03-08 15:48:50,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:48" (2/3) ... [2025-03-08 15:48:50,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b0e9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:50, skipping insertion in model container [2025-03-08 15:48:50,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:50" (3/3) ... [2025-03-08 15:48:50,108 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-88.i [2025-03-08 15:48:50,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:48:50,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-88.i that has 2 procedures, 305 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:48:50,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:48:50,186 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;@6234f292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:48:50,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:48:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 238 states have internal predecessors, (367), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 15:48:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 15:48:50,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:50,214 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:50,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:50,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -897526552, now seen corresponding path program 1 times [2025-03-08 15:48:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89523709] [2025-03-08 15:48:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:50,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:48:50,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:48:50,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:50,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-08 15:48:50,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:50,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89523709] [2025-03-08 15:48:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89523709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256537074] [2025-03-08 15:48:50,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:50,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:50,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:48:51,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:48:51,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:48:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:51,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:48:51,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-08 15:48:51,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:48:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256537074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:48:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:48:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393192585] [2025-03-08 15:48:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:51,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:48:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:51,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:48:51,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:51,267 INFO L87 Difference]: Start difference. First operand has 305 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 238 states have internal predecessors, (367), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-08 15:48:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:51,337 INFO L93 Difference]: Finished difference Result 604 states and 1054 transitions. [2025-03-08 15:48:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:48:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 464 [2025-03-08 15:48:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:51,351 INFO L225 Difference]: With dead ends: 604 [2025-03-08 15:48:51,351 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 15:48:51,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:51,358 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:51,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 15:48:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-03-08 15:48:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 235 states have (on average 1.5404255319148936) internal successors, (362), 235 states have internal predecessors, (362), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 15:48:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 492 transitions. [2025-03-08 15:48:51,456 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 492 transitions. Word has length 464 [2025-03-08 15:48:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 492 transitions. [2025-03-08 15:48:51,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-08 15:48:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 492 transitions. [2025-03-08 15:48:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 15:48:51,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:51,468 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:51,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:48:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:48:51,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash -161825009, now seen corresponding path program 1 times [2025-03-08 15:48:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792921673] [2025-03-08 15:48:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:51,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:48:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:48:51,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:51,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792921673] [2025-03-08 15:48:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792921673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:52,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537395486] [2025-03-08 15:48:52,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:52,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:52,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:52,082 INFO L87 Difference]: Start difference. First operand 302 states and 492 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:52,235 INFO L93 Difference]: Finished difference Result 799 states and 1301 transitions. [2025-03-08 15:48:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 464 [2025-03-08 15:48:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:52,240 INFO L225 Difference]: With dead ends: 799 [2025-03-08 15:48:52,244 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 15:48:52,245 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-03-08 15:48:52,245 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 336 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:52,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 940 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 15:48:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2025-03-08 15:48:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 416 states have (on average 1.5600961538461537) internal successors, (649), 417 states have internal predecessors, (649), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:48:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 805 transitions. [2025-03-08 15:48:52,286 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 805 transitions. Word has length 464 [2025-03-08 15:48:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:52,287 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 805 transitions. [2025-03-08 15:48:52,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 805 transitions. [2025-03-08 15:48:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 15:48:52,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:52,296 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:52,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:48:52,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:52,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash -733076242, now seen corresponding path program 1 times [2025-03-08 15:48:52,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:52,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105318355] [2025-03-08 15:48:52,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:52,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:48:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:48:52,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:52,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105318355] [2025-03-08 15:48:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105318355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308684672] [2025-03-08 15:48:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:52,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:52,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:52,716 INFO L87 Difference]: Start difference. First operand 497 states and 805 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:52,869 INFO L93 Difference]: Finished difference Result 1463 states and 2368 transitions. [2025-03-08 15:48:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:52,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 464 [2025-03-08 15:48:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:52,881 INFO L225 Difference]: With dead ends: 1463 [2025-03-08 15:48:52,882 INFO L226 Difference]: Without dead ends: 969 [2025-03-08 15:48:52,884 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-03-08 15:48:52,884 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 465 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:52,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 941 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-08 15:48:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 505. [2025-03-08 15:48:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 424 states have (on average 1.5566037735849056) internal successors, (660), 425 states have internal predecessors, (660), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:48:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 816 transitions. [2025-03-08 15:48:52,939 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 816 transitions. Word has length 464 [2025-03-08 15:48:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:52,940 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 816 transitions. [2025-03-08 15:48:52,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 816 transitions. [2025-03-08 15:48:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 15:48:52,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:52,949 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:52,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:48:52,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -719543441, now seen corresponding path program 1 times [2025-03-08 15:48:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222873452] [2025-03-08 15:48:52,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:53,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:48:53,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:48:53,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:53,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222873452] [2025-03-08 15:48:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222873452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248722912] [2025-03-08 15:48:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:53,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:53,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:53,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:53,424 INFO L87 Difference]: Start difference. First operand 505 states and 816 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:53,560 INFO L93 Difference]: Finished difference Result 1360 states and 2198 transitions. [2025-03-08 15:48:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:53,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 464 [2025-03-08 15:48:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:53,565 INFO L225 Difference]: With dead ends: 1360 [2025-03-08 15:48:53,565 INFO L226 Difference]: Without dead ends: 858 [2025-03-08 15:48:53,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:53,567 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 335 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:53,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1805 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-08 15:48:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 856. [2025-03-08 15:48:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 695 states have (on average 1.5381294964028778) internal successors, (1069), 697 states have internal predecessors, (1069), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 154 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-08 15:48:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1381 transitions. [2025-03-08 15:48:53,627 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1381 transitions. Word has length 464 [2025-03-08 15:48:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:53,628 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1381 transitions. [2025-03-08 15:48:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1381 transitions. [2025-03-08 15:48:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 15:48:53,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:53,633 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:48:53,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:53,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1357534447, now seen corresponding path program 1 times [2025-03-08 15:48:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695763607] [2025-03-08 15:48:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:53,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:48:53,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:48:53,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:53,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695763607] [2025-03-08 15:48:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695763607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497969829] [2025-03-08 15:48:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:54,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:54,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:54,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:54,732 INFO L87 Difference]: Start difference. First operand 856 states and 1381 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:55,128 INFO L93 Difference]: Finished difference Result 2046 states and 3287 transitions. [2025-03-08 15:48:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 464 [2025-03-08 15:48:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:55,135 INFO L225 Difference]: With dead ends: 2046 [2025-03-08 15:48:55,136 INFO L226 Difference]: Without dead ends: 1216 [2025-03-08 15:48:55,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:55,140 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 603 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:55,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1322 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:48:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-03-08 15:48:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 805. [2025-03-08 15:48:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 657 states have (on average 1.5449010654490107) internal successors, (1015), 658 states have internal predecessors, (1015), 143 states have call successors, (143), 4 states have call predecessors, (143), 4 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-08 15:48:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1301 transitions. [2025-03-08 15:48:55,190 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1301 transitions. Word has length 464 [2025-03-08 15:48:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1301 transitions. [2025-03-08 15:48:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1301 transitions. [2025-03-08 15:48:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 15:48:55,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:55,200 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:55,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:48:55,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:55,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -597835837, now seen corresponding path program 1 times [2025-03-08 15:48:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436150027] [2025-03-08 15:48:55,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:55,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 15:48:55,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 15:48:55,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:55,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436150027] [2025-03-08 15:48:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436150027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:56,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:48:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993897485] [2025-03-08 15:48:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:56,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:48:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:56,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:48:56,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:56,125 INFO L87 Difference]: Start difference. First operand 805 states and 1301 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:56,658 INFO L93 Difference]: Finished difference Result 2333 states and 3742 transitions. [2025-03-08 15:48:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:48:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 465 [2025-03-08 15:48:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:56,666 INFO L225 Difference]: With dead ends: 2333 [2025-03-08 15:48:56,666 INFO L226 Difference]: Without dead ends: 1552 [2025-03-08 15:48:56,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:56,668 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 883 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:56,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1766 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:48:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-03-08 15:48:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 835. [2025-03-08 15:48:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 687 states have (on average 1.544395924308588) internal successors, (1061), 688 states have internal predecessors, (1061), 143 states have call successors, (143), 4 states have call predecessors, (143), 4 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-08 15:48:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1347 transitions. [2025-03-08 15:48:56,713 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1347 transitions. Word has length 465 [2025-03-08 15:48:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1347 transitions. [2025-03-08 15:48:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1347 transitions. [2025-03-08 15:48:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 15:48:56,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:56,717 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:48:56,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:56,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1807078076, now seen corresponding path program 1 times [2025-03-08 15:48:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732931307] [2025-03-08 15:48:56,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:56,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 15:48:56,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 15:48:56,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:56,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732931307] [2025-03-08 15:48:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732931307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:56,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167407786] [2025-03-08 15:48:56,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:56,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:56,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:56,970 INFO L87 Difference]: Start difference. First operand 835 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:57,238 INFO L93 Difference]: Finished difference Result 2285 states and 3669 transitions. [2025-03-08 15:48:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:48:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 465 [2025-03-08 15:48:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:57,249 INFO L225 Difference]: With dead ends: 2285 [2025-03-08 15:48:57,249 INFO L226 Difference]: Without dead ends: 1476 [2025-03-08 15:48:57,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:57,253 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 626 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:57,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1359 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:48:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-03-08 15:48:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1411. [2025-03-08 15:48:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1225 states have (on average 1.5551020408163265) internal successors, (1905), 1228 states have internal predecessors, (1905), 177 states have call successors, (177), 8 states have call predecessors, (177), 8 states have return successors, (177), 174 states have call predecessors, (177), 177 states have call successors, (177) [2025-03-08 15:48:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2259 transitions. [2025-03-08 15:48:57,322 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2259 transitions. Word has length 465 [2025-03-08 15:48:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:57,323 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2259 transitions. [2025-03-08 15:48:57,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2259 transitions. [2025-03-08 15:48:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 15:48:57,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:57,329 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:48:57,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:57,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 622185660, now seen corresponding path program 1 times [2025-03-08 15:48:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:57,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104005353] [2025-03-08 15:48:57,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:57,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 15:48:57,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 15:48:57,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:57,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104005353] [2025-03-08 15:48:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104005353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:58,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:48:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673570467] [2025-03-08 15:48:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:58,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:48:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:58,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:48:58,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:58,078 INFO L87 Difference]: Start difference. First operand 1411 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:58,460 INFO L93 Difference]: Finished difference Result 3063 states and 4876 transitions. [2025-03-08 15:48:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:48:58,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 465 [2025-03-08 15:48:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:58,470 INFO L225 Difference]: With dead ends: 3063 [2025-03-08 15:48:58,470 INFO L226 Difference]: Without dead ends: 1678 [2025-03-08 15:48:58,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:58,474 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 855 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:58,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1668 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:48:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-08 15:48:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1417. [2025-03-08 15:48:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1244 states have (on average 1.5546623794212218) internal successors, (1934), 1246 states have internal predecessors, (1934), 164 states have call successors, (164), 8 states have call predecessors, (164), 8 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:48:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2262 transitions. [2025-03-08 15:48:58,537 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2262 transitions. Word has length 465 [2025-03-08 15:48:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:58,537 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 2262 transitions. [2025-03-08 15:48:58,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2262 transitions. [2025-03-08 15:48:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-08 15:48:58,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:58,541 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:48:58,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:58,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2004290147, now seen corresponding path program 1 times [2025-03-08 15:48:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425319580] [2025-03-08 15:48:58,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:58,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-08 15:48:58,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-08 15:48:58,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:58,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:48:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425319580] [2025-03-08 15:48:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425319580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145965925] [2025-03-08 15:48:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:59,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:59,108 INFO L87 Difference]: Start difference. First operand 1417 states and 2262 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:59,382 INFO L93 Difference]: Finished difference Result 2817 states and 4493 transitions. [2025-03-08 15:48:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 465 [2025-03-08 15:48:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:59,390 INFO L225 Difference]: With dead ends: 2817 [2025-03-08 15:48:59,390 INFO L226 Difference]: Without dead ends: 1403 [2025-03-08 15:48:59,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:48:59,395 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 610 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:59,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 462 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:48:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-08 15:48:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1403. [2025-03-08 15:48:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1230 states have (on average 1.532520325203252) internal successors, (1885), 1232 states have internal predecessors, (1885), 164 states have call successors, (164), 8 states have call predecessors, (164), 8 states have return successors, (164), 162 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:48:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2213 transitions. [2025-03-08 15:48:59,466 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2213 transitions. Word has length 465 [2025-03-08 15:48:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:59,467 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2213 transitions. [2025-03-08 15:48:59,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:48:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2213 transitions. [2025-03-08 15:48:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:48:59,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:59,473 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:59,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:48:59,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 449076591, now seen corresponding path program 1 times [2025-03-08 15:48:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819902760] [2025-03-08 15:48:59,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:59,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:49:00,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:49:00,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:00,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:49:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819902760] [2025-03-08 15:49:00,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819902760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:00,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:00,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:49:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595798918] [2025-03-08 15:49:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:00,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:49:00,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:00,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:49:00,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:49:00,533 INFO L87 Difference]: Start difference. First operand 1403 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:00,972 INFO L93 Difference]: Finished difference Result 4091 states and 6439 transitions. [2025-03-08 15:49:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:49:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-03-08 15:49:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:00,985 INFO L225 Difference]: With dead ends: 4091 [2025-03-08 15:49:00,985 INFO L226 Difference]: Without dead ends: 2691 [2025-03-08 15:49:00,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:49:00,989 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 635 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:00,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1721 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:49:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2025-03-08 15:49:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2642. [2025-03-08 15:49:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2361 states have (on average 1.5345192714951292) internal successors, (3623), 2367 states have internal predecessors, (3623), 264 states have call successors, (264), 16 states have call predecessors, (264), 16 states have return successors, (264), 258 states have call predecessors, (264), 264 states have call successors, (264) [2025-03-08 15:49:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 4151 transitions. [2025-03-08 15:49:01,118 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 4151 transitions. Word has length 466 [2025-03-08 15:49:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:01,119 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 4151 transitions. [2025-03-08 15:49:01,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 4151 transitions. [2025-03-08 15:49:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:49:01,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:01,126 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:49:01,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:49:01,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:01,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1912695790, now seen corresponding path program 1 times [2025-03-08 15:49:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:01,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103225503] [2025-03-08 15:49:01,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:01,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:49:01,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:49:01,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:01,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:49:01,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:01,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103225503] [2025-03-08 15:49:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103225503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:01,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:49:01,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179609851] [2025-03-08 15:49:01,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:01,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:49:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:01,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:49:01,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:01,318 INFO L87 Difference]: Start difference. First operand 2642 states and 4151 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:01,582 INFO L93 Difference]: Finished difference Result 7295 states and 11414 transitions. [2025-03-08 15:49:01,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:49:01,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-03-08 15:49:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:01,606 INFO L225 Difference]: With dead ends: 7295 [2025-03-08 15:49:01,607 INFO L226 Difference]: Without dead ends: 4656 [2025-03-08 15:49:01,614 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-03-08 15:49:01,614 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 236 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:01,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 908 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:49:01,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2025-03-08 15:49:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4646. [2025-03-08 15:49:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4646 states, 4229 states have (on average 1.5277843461811302) internal successors, (6461), 4243 states have internal predecessors, (6461), 384 states have call successors, (384), 32 states have call predecessors, (384), 32 states have return successors, (384), 370 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-08 15:49:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4646 states to 4646 states and 7229 transitions. [2025-03-08 15:49:01,881 INFO L78 Accepts]: Start accepts. Automaton has 4646 states and 7229 transitions. Word has length 466 [2025-03-08 15:49:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:01,882 INFO L471 AbstractCegarLoop]: Abstraction has 4646 states and 7229 transitions. [2025-03-08 15:49:01,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4646 states and 7229 transitions. [2025-03-08 15:49:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:49:01,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:01,891 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:49:01,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:49:01,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:01,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash -58978002, now seen corresponding path program 1 times [2025-03-08 15:49:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134758621] [2025-03-08 15:49:01,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:01,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:01,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:49:02,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:49:02,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:02,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:49:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:03,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134758621] [2025-03-08 15:49:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134758621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:03,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:49:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658721364] [2025-03-08 15:49:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:03,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:49:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:03,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:49:03,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:49:03,055 INFO L87 Difference]: Start difference. First operand 4646 states and 7229 transitions. Second operand has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:06,486 INFO L93 Difference]: Finished difference Result 24546 states and 38205 transitions. [2025-03-08 15:49:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:49:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-03-08 15:49:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:06,540 INFO L225 Difference]: With dead ends: 24546 [2025-03-08 15:49:06,541 INFO L226 Difference]: Without dead ends: 19903 [2025-03-08 15:49:06,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:49:06,555 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 3033 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 3464 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:06,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 3464 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 15:49:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19903 states. [2025-03-08 15:49:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19903 to 15913. [2025-03-08 15:49:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15913 states, 14611 states have (on average 1.5216617616864005) internal successors, (22233), 14672 states have internal predecessors, (22233), 1185 states have call successors, (1185), 116 states have call predecessors, (1185), 116 states have return successors, (1185), 1124 states have call predecessors, (1185), 1185 states have call successors, (1185) [2025-03-08 15:49:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15913 states to 15913 states and 24603 transitions. [2025-03-08 15:49:07,450 INFO L78 Accepts]: Start accepts. Automaton has 15913 states and 24603 transitions. Word has length 466 [2025-03-08 15:49:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:07,451 INFO L471 AbstractCegarLoop]: Abstraction has 15913 states and 24603 transitions. [2025-03-08 15:49:07,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15913 states and 24603 transitions. [2025-03-08 15:49:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:49:07,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:07,468 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:49:07,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:49:07,468 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 181562127, now seen corresponding path program 1 times [2025-03-08 15:49:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434982216] [2025-03-08 15:49:07,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:07,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:07,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:49:07,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:49:07,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:07,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:49:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434982216] [2025-03-08 15:49:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434982216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029950886] [2025-03-08 15:49:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:08,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:08,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:08,298 INFO L87 Difference]: Start difference. First operand 15913 states and 24603 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:09,051 INFO L93 Difference]: Finished difference Result 40291 states and 62273 transitions. [2025-03-08 15:49:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-03-08 15:49:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:09,113 INFO L225 Difference]: With dead ends: 40291 [2025-03-08 15:49:09,113 INFO L226 Difference]: Without dead ends: 24499 [2025-03-08 15:49:09,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:49:09,138 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 407 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:09,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1391 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:49:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24499 states. [2025-03-08 15:49:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24499 to 15915. [2025-03-08 15:49:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15915 states, 14613 states have (on average 1.5215903647437214) internal successors, (22235), 14673 states have internal predecessors, (22235), 1185 states have call successors, (1185), 116 states have call predecessors, (1185), 116 states have return successors, (1185), 1125 states have call predecessors, (1185), 1185 states have call successors, (1185) [2025-03-08 15:49:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15915 states to 15915 states and 24605 transitions. [2025-03-08 15:49:09,919 INFO L78 Accepts]: Start accepts. Automaton has 15915 states and 24605 transitions. Word has length 466 [2025-03-08 15:49:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 15915 states and 24605 transitions. [2025-03-08 15:49:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15915 states and 24605 transitions. [2025-03-08 15:49:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:49:09,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:09,934 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:49:09,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:49:09,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:09,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1878947915, now seen corresponding path program 1 times [2025-03-08 15:49:09,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:09,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126447273] [2025-03-08 15:49:09,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:09,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:49:10,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:49:10,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:10,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:49:10,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:10,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126447273] [2025-03-08 15:49:10,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126447273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:10,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:10,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:10,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614052694] [2025-03-08 15:49:10,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:10,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:10,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:10,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:10,774 INFO L87 Difference]: Start difference. First operand 15915 states and 24605 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:11,582 INFO L93 Difference]: Finished difference Result 31713 states and 49031 transitions. [2025-03-08 15:49:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-03-08 15:49:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:11,627 INFO L225 Difference]: With dead ends: 31713 [2025-03-08 15:49:11,627 INFO L226 Difference]: Without dead ends: 15921 [2025-03-08 15:49:11,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:11,656 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 622 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:11,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1023 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:49:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15921 states. [2025-03-08 15:49:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15921 to 15915. [2025-03-08 15:49:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15915 states, 14613 states have (on average 1.519947991514405) internal successors, (22211), 14673 states have internal predecessors, (22211), 1185 states have call successors, (1185), 116 states have call predecessors, (1185), 116 states have return successors, (1185), 1125 states have call predecessors, (1185), 1185 states have call successors, (1185) [2025-03-08 15:49:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15915 states to 15915 states and 24581 transitions. [2025-03-08 15:49:12,307 INFO L78 Accepts]: Start accepts. Automaton has 15915 states and 24581 transitions. Word has length 466 [2025-03-08 15:49:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 15915 states and 24581 transitions. [2025-03-08 15:49:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:49:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15915 states and 24581 transitions. [2025-03-08 15:49:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:49:12,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:12,323 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:49:12,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:49:12,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:12,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1996502550, now seen corresponding path program 1 times [2025-03-08 15:49:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573078924] [2025-03-08 15:49:12,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:12,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:49:12,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:49:12,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:12,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat