./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_fillercode_fillercodesize_ps-cn-250_file-30.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 063c198d6cbadf676860cb316f87c54fd753e5e88083f0e3e7a00edd28972590 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:45:43,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:45:43,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:45:43,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:45:43,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:45:43,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:45:43,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:45:43,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:45:43,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:45:43,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:45:43,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:45:43,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:45:43,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:45:43,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:45:43,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:45:43,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:45:43,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:45:43,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:45:43,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:45:43,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:45:43,367 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 -> 063c198d6cbadf676860cb316f87c54fd753e5e88083f0e3e7a00edd28972590 [2025-03-03 19:45:43,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:45:43,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:45:43,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:45:43,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:45:43,600 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:45:43,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-30.i [2025-03-03 19:45:44,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a43eb0e/e17bde288f384588bf1b92b9b1034130/FLAG897ac65c4 [2025-03-03 19:45:45,023 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:45:45,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-30.i [2025-03-03 19:45:45,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a43eb0e/e17bde288f384588bf1b92b9b1034130/FLAG897ac65c4 [2025-03-03 19:45:45,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a43eb0e/e17bde288f384588bf1b92b9b1034130 [2025-03-03 19:45:45,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:45:45,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:45:45,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:45:45,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:45:45,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:45:45,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdcaa32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45, skipping insertion in model container [2025-03-03 19:45:45,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:45:45,429 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_fillercode_fillercodesize_ps-cn-250_file-30.i[916,929] [2025-03-03 19:45:45,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:45:45,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:45:45,567 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_fillercode_fillercodesize_ps-cn-250_file-30.i[916,929] [2025-03-03 19:45:45,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:45:45,626 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:45:45,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45 WrapperNode [2025-03-03 19:45:45,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:45:45,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:45:45,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:45:45,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:45:45,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,681 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 569 [2025-03-03 19:45:45,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:45:45,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:45:45,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:45:45,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:45:45,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,722 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-03 19:45:45,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:45:45,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:45:45,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:45:45,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:45:45,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (1/1) ... [2025-03-03 19:45:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:45:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:45,782 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-03 19:45:45,785 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-03 19:45:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:45:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:45:45,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:45:45,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:45:45,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:45:45,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:45:45,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:45:45,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:45:46,355 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc property_#t~bitwise58#1;havoc property_#t~short59#1; [2025-03-03 19:45:46,428 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 19:45:46,428 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:45:46,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:45:46,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:45:46,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:45:46 BoogieIcfgContainer [2025-03-03 19:45:46,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:45:46,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:45:46,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:45:46,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:45:46,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:45:45" (1/3) ... [2025-03-03 19:45:46,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47910f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:45:46, skipping insertion in model container [2025-03-03 19:45:46,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:45" (2/3) ... [2025-03-03 19:45:46,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47910f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:45:46, skipping insertion in model container [2025-03-03 19:45:46,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:45:46" (3/3) ... [2025-03-03 19:45:46,460 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-30.i [2025-03-03 19:45:46,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:45:46,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-30.i that has 2 procedures, 234 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:45:46,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:45:46,521 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;@742c4406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:45:46,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:45:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 158 states have internal predecessors, (242), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:45:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:45:46,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:46,550 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:46,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1239995383, now seen corresponding path program 1 times [2025-03-03 19:45:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:46,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086578123] [2025-03-03 19:45:46,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:46,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:45:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:45:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:45:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:47,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086578123] [2025-03-03 19:45:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086578123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295993901] [2025-03-03 19:45:47,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:47,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:47,019 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-03 19:45:47,020 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-03 19:45:47,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:45:47,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:45:47,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:47,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:47,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:45:47,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-03 19:45:47,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:45:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295993901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:45:47,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:45:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726175880] [2025-03-03 19:45:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:45:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:47,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:45:47,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:45:47,379 INFO L87 Difference]: Start difference. First operand has 234 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 158 states have internal predecessors, (242), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:45:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:47,434 INFO L93 Difference]: Finished difference Result 462 states and 849 transitions. [2025-03-03 19:45:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:45:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 470 [2025-03-03 19:45:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:47,444 INFO L225 Difference]: With dead ends: 462 [2025-03-03 19:45:47,445 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 19:45:47,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 471 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-03 19:45:47,450 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:47,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 19:45:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-03 19:45:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 155 states have (on average 1.5290322580645161) internal successors, (237), 155 states have internal predecessors, (237), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:45:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 385 transitions. [2025-03-03 19:45:47,507 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 385 transitions. Word has length 470 [2025-03-03 19:45:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:47,507 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 385 transitions. [2025-03-03 19:45:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:45:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 385 transitions. [2025-03-03 19:45:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:45:47,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:47,519 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:47,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:45:47,720 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-03 19:45:47,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1632919277, now seen corresponding path program 1 times [2025-03-03 19:45:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274723700] [2025-03-03 19:45:47,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:45:47,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:45:47,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:47,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:45:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274723700] [2025-03-03 19:45:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274723700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531197470] [2025-03-03 19:45:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:48,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:48,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:48,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:48,090 INFO L87 Difference]: Start difference. First operand 231 states and 385 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:48,179 INFO L93 Difference]: Finished difference Result 579 states and 967 transitions. [2025-03-03 19:45:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:48,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-03-03 19:45:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:48,183 INFO L225 Difference]: With dead ends: 579 [2025-03-03 19:45:48,185 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 19:45:48,186 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-03 19:45:48,187 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 212 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:48,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 852 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:45:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 19:45:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 348. [2025-03-03 19:45:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 253 states have (on average 1.5691699604743083) internal successors, (397), 254 states have internal predecessors, (397), 92 states have call successors, (92), 2 states have call predecessors, (92), 2 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 19:45:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 581 transitions. [2025-03-03 19:45:48,248 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 581 transitions. Word has length 470 [2025-03-03 19:45:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:48,250 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 581 transitions. [2025-03-03 19:45:48,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 581 transitions. [2025-03-03 19:45:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 19:45:48,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:48,257 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:48,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:45:48,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:48,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -730645332, now seen corresponding path program 1 times [2025-03-03 19:45:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641836424] [2025-03-03 19:45:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:48,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 19:45:48,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 19:45:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:45:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:48,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641836424] [2025-03-03 19:45:48,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641836424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:48,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:48,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329533851] [2025-03-03 19:45:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:48,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:48,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:48,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:48,640 INFO L87 Difference]: Start difference. First operand 348 states and 581 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:48,730 INFO L93 Difference]: Finished difference Result 1038 states and 1737 transitions. [2025-03-03 19:45:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 470 [2025-03-03 19:45:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:48,739 INFO L225 Difference]: With dead ends: 1038 [2025-03-03 19:45:48,740 INFO L226 Difference]: Without dead ends: 693 [2025-03-03 19:45:48,741 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-03 19:45:48,741 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 375 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:48,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 733 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-03 19:45:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 689. [2025-03-03 19:45:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 500 states have (on average 1.568) internal successors, (784), 502 states have internal predecessors, (784), 184 states have call successors, (184), 4 states have call predecessors, (184), 4 states have return successors, (184), 182 states have call predecessors, (184), 184 states have call successors, (184) [2025-03-03 19:45:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1152 transitions. [2025-03-03 19:45:48,856 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1152 transitions. Word has length 470 [2025-03-03 19:45:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:48,857 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1152 transitions. [2025-03-03 19:45:48,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1152 transitions. [2025-03-03 19:45:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:48,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:48,864 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:45:48,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:48,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2075104598, now seen corresponding path program 1 times [2025-03-03 19:45:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438757402] [2025-03-03 19:45:48,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:48,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:48,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:48,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:48,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:45:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438757402] [2025-03-03 19:45:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438757402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:49,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:49,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2362391] [2025-03-03 19:45:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:49,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:49,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:49,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:49,062 INFO L87 Difference]: Start difference. First operand 689 states and 1152 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:49,166 INFO L93 Difference]: Finished difference Result 1807 states and 2990 transitions. [2025-03-03 19:45:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:49,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 471 [2025-03-03 19:45:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:49,176 INFO L225 Difference]: With dead ends: 1807 [2025-03-03 19:45:49,177 INFO L226 Difference]: Without dead ends: 1121 [2025-03-03 19:45:49,178 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-03 19:45:49,180 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 226 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:49,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 946 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-03 19:45:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1117. [2025-03-03 19:45:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 764 states have (on average 1.5) internal successors, (1146), 770 states have internal predecessors, (1146), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 338 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-03 19:45:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1834 transitions. [2025-03-03 19:45:49,343 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1834 transitions. Word has length 471 [2025-03-03 19:45:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:49,346 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1834 transitions. [2025-03-03 19:45:49,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1834 transitions. [2025-03-03 19:45:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:49,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:49,353 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:49,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:45:49,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:49,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2008097845, now seen corresponding path program 1 times [2025-03-03 19:45:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:49,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874731047] [2025-03-03 19:45:49,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:49,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:49,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:49,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:49,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:49,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:45:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874731047] [2025-03-03 19:45:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874731047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745286406] [2025-03-03 19:45:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:49,721 INFO L87 Difference]: Start difference. First operand 1117 states and 1834 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:49,874 INFO L93 Difference]: Finished difference Result 3343 states and 5494 transitions. [2025-03-03 19:45:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:49,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 471 [2025-03-03 19:45:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:49,886 INFO L225 Difference]: With dead ends: 3343 [2025-03-03 19:45:49,886 INFO L226 Difference]: Without dead ends: 2229 [2025-03-03 19:45:49,890 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-03 19:45:49,890 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 364 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:49,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 755 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-03-03 19:45:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2227. [2025-03-03 19:45:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 1522 states have (on average 1.4993429697766096) internal successors, (2282), 1534 states have internal predecessors, (2282), 688 states have call successors, (688), 16 states have call predecessors, (688), 16 states have return successors, (688), 676 states have call predecessors, (688), 688 states have call successors, (688) [2025-03-03 19:45:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3658 transitions. [2025-03-03 19:45:50,046 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3658 transitions. Word has length 471 [2025-03-03 19:45:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:50,047 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 3658 transitions. [2025-03-03 19:45:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3658 transitions. [2025-03-03 19:45:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-03 19:45:50,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:50,054 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:50,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:45:50,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:50,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash -175579082, now seen corresponding path program 1 times [2025-03-03 19:45:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259494065] [2025-03-03 19:45:50,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-03 19:45:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-03 19:45:50,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:50,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:45:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:50,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259494065] [2025-03-03 19:45:50,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259494065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:50,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:50,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:45:50,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528139845] [2025-03-03 19:45:50,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:50,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:45:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:50,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:45:50,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:45:50,457 INFO L87 Difference]: Start difference. First operand 2227 states and 3658 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:51,107 INFO L93 Difference]: Finished difference Result 7077 states and 11625 transitions. [2025-03-03 19:45:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:45:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 471 [2025-03-03 19:45:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:51,135 INFO L225 Difference]: With dead ends: 7077 [2025-03-03 19:45:51,135 INFO L226 Difference]: Without dead ends: 4853 [2025-03-03 19:45:51,144 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-03 19:45:51,145 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 383 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:51,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1134 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:45:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2025-03-03 19:45:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 4449. [2025-03-03 19:45:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 3040 states have (on average 1.4842105263157894) internal successors, (4512), 3064 states have internal predecessors, (4512), 1376 states have call successors, (1376), 32 states have call predecessors, (1376), 32 states have return successors, (1376), 1352 states have call predecessors, (1376), 1376 states have call successors, (1376) [2025-03-03 19:45:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 7264 transitions. [2025-03-03 19:45:51,502 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 7264 transitions. Word has length 471 [2025-03-03 19:45:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:51,503 INFO L471 AbstractCegarLoop]: Abstraction has 4449 states and 7264 transitions. [2025-03-03 19:45:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 7264 transitions. [2025-03-03 19:45:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:45:51,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:51,507 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:45:51,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 144198246, now seen corresponding path program 1 times [2025-03-03 19:45:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585719077] [2025-03-03 19:45:51,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:51,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:45:51,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:45:51,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:51,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:45:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585719077] [2025-03-03 19:45:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585719077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:52,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:52,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:45:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095679211] [2025-03-03 19:45:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:45:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:45:52,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:45:52,353 INFO L87 Difference]: Start difference. First operand 4449 states and 7264 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:53,535 INFO L93 Difference]: Finished difference Result 18433 states and 29932 transitions. [2025-03-03 19:45:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:45:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 472 [2025-03-03 19:45:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:53,617 INFO L225 Difference]: With dead ends: 18433 [2025-03-03 19:45:53,617 INFO L226 Difference]: Without dead ends: 13987 [2025-03-03 19:45:53,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:45:53,637 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 931 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:53,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1489 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:45:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13987 states. [2025-03-03 19:45:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13987 to 8077. [2025-03-03 19:45:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8077 states, 5964 states have (on average 1.5298457411133468) internal successors, (9124), 6020 states have internal predecessors, (9124), 2048 states have call successors, (2048), 64 states have call predecessors, (2048), 64 states have return successors, (2048), 1992 states have call predecessors, (2048), 2048 states have call successors, (2048) [2025-03-03 19:45:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8077 states to 8077 states and 13220 transitions. [2025-03-03 19:45:54,165 INFO L78 Accepts]: Start accepts. Automaton has 8077 states and 13220 transitions. Word has length 472 [2025-03-03 19:45:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:54,166 INFO L471 AbstractCegarLoop]: Abstraction has 8077 states and 13220 transitions. [2025-03-03 19:45:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:45:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8077 states and 13220 transitions. [2025-03-03 19:45:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:45:54,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:54,177 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:45:54,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:45:54,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:54,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2039478681, now seen corresponding path program 1 times [2025-03-03 19:45:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042468759] [2025-03-03 19:45:54,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:45:54,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:45:54,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:54,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:03,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:03,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042468759] [2025-03-03 19:46:03,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042468759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:03,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:03,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 19:46:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888215902] [2025-03-03 19:46:03,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:03,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 19:46:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:03,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 19:46:03,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:46:03,103 INFO L87 Difference]: Start difference. First operand 8077 states and 13220 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:20,980 INFO L93 Difference]: Finished difference Result 67908 states and 108345 transitions. [2025-03-03 19:46:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 19:46:20,981 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 472 [2025-03-03 19:46:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:21,189 INFO L225 Difference]: With dead ends: 67908 [2025-03-03 19:46:21,190 INFO L226 Difference]: Without dead ends: 59834 [2025-03-03 19:46:21,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=515, Invalid=1465, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 19:46:21,241 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 6653 mSDsluCounter, 4531 mSDsCounter, 0 mSdLazyCounter, 3645 mSolverCounterSat, 2598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6653 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 6243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2598 IncrementalHoareTripleChecker+Valid, 3645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:21,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6653 Valid, 5035 Invalid, 6243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2598 Valid, 3645 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-03 19:46:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59834 states. [2025-03-03 19:46:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59834 to 43014. [2025-03-03 19:46:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43014 states, 31471 states have (on average 1.4847002001842966) internal successors, (46725), 31874 states have internal predecessors, (46725), 10992 states have call successors, (10992), 550 states have call predecessors, (10992), 550 states have return successors, (10992), 10589 states have call predecessors, (10992), 10992 states have call successors, (10992) [2025-03-03 19:46:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43014 states to 43014 states and 68709 transitions. [2025-03-03 19:46:27,290 INFO L78 Accepts]: Start accepts. Automaton has 43014 states and 68709 transitions. Word has length 472 [2025-03-03 19:46:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:27,290 INFO L471 AbstractCegarLoop]: Abstraction has 43014 states and 68709 transitions. [2025-03-03 19:46:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-03 19:46:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 43014 states and 68709 transitions. [2025-03-03 19:46:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:46:27,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:27,314 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:46:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:46:27,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1688678744, now seen corresponding path program 1 times [2025-03-03 19:46:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167499507] [2025-03-03 19:46:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:27,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:46:27,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:46:27,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:27,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-03 19:46:30,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:30,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167499507] [2025-03-03 19:46:30,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167499507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:30,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 19:46:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815291058] [2025-03-03 19:46:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:30,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:46:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:30,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:46:30,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:46:30,114 INFO L87 Difference]: Start difference. First operand 43014 states and 68709 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:46:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:51,220 INFO L93 Difference]: Finished difference Result 147168 states and 232932 transitions. [2025-03-03 19:46:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 19:46:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 472 [2025-03-03 19:46:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:51,594 INFO L225 Difference]: With dead ends: 147168 [2025-03-03 19:46:51,594 INFO L226 Difference]: Without dead ends: 104203 [2025-03-03 19:46:51,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2025-03-03 19:46:51,716 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 3264 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 1174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3264 SdHoareTripleChecker+Valid, 3943 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1174 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:51,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3264 Valid, 3943 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1174 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 19:46:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104203 states. [2025-03-03 19:47:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104203 to 68221. [2025-03-03 19:47:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68221 states, 49580 states have (on average 1.4768051633723276) internal successors, (73220), 50212 states have internal predecessors, (73220), 17648 states have call successors, (17648), 992 states have call predecessors, (17648), 992 states have return successors, (17648), 17016 states have call predecessors, (17648), 17648 states have call successors, (17648) [2025-03-03 19:47:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68221 states to 68221 states and 108516 transitions. [2025-03-03 19:47:02,072 INFO L78 Accepts]: Start accepts. Automaton has 68221 states and 108516 transitions. Word has length 472 [2025-03-03 19:47:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:02,072 INFO L471 AbstractCegarLoop]: Abstraction has 68221 states and 108516 transitions. [2025-03-03 19:47:02,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 2 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-03 19:47:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 68221 states and 108516 transitions. [2025-03-03 19:47:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 19:47:02,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:02,107 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:47:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:47:02,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:02,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -313997784, now seen corresponding path program 1 times [2025-03-03 19:47:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655876124] [2025-03-03 19:47:02,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:02,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:47:02,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:47:02,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:02,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 108 proven. 111 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:47:02,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655876124] [2025-03-03 19:47:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655876124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:47:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774557729] [2025-03-03 19:47:02,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:02,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:47:02,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:47:02,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:47:02,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:47:02,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 19:47:02,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 19:47:02,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:02,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:02,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:47:02,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:47:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 2925 proven. 33 refuted. 0 times theorem prover too weak. 7846 trivial. 0 not checked. [2025-03-03 19:47:02,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:47:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 186 proven. 33 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-03 19:47:03,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774557729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:47:03,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:47:03,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 19:47:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915086204] [2025-03-03 19:47:03,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:47:03,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:47:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:03,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:47:03,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:47:03,117 INFO L87 Difference]: Start difference. First operand 68221 states and 108516 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124)