./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fillercodestructure_filler-pr-ci_file-66.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 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:25:42,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:25:42,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:25:42,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:25:42,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:25:43,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:25:43,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:25:43,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:25:43,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:25:43,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:25:43,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:25:43,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:25:43,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:25:43,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:25:43,025 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:25:43,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:25:43,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:25:43,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:25:43,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:25:43,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:25:43,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:25:43,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:25:43,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:25:43,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:25:43,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:25:43,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:25:43,028 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 -> 0cbadd5c8de40e45d11c8c9bd5d5aa33e26bba45cb60181d9a1abcae7f03bb4b [2025-03-17 01:25:43,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:25:43,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:25:43,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:25:43,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:25:43,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:25:43,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-03-17 01:25:44,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9996a6ea2/40ae4015a00046eabc8890ad526cd552/FLAG25cdc5b0d [2025-03-17 01:25:44,772 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:25:44,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-03-17 01:25:44,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9996a6ea2/40ae4015a00046eabc8890ad526cd552/FLAG25cdc5b0d [2025-03-17 01:25:45,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9996a6ea2/40ae4015a00046eabc8890ad526cd552 [2025-03-17 01:25:45,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:25:45,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:25:45,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:25:45,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:25:45,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:25:45,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd6cda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45, skipping insertion in model container [2025-03-17 01:25:45,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:25:45,237 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_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-03-17 01:25:45,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:25:45,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:25:45,305 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_fillercodestructure_filler-pr-ci_file-66.i[919,932] [2025-03-17 01:25:45,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:25:45,357 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:25:45,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45 WrapperNode [2025-03-17 01:25:45,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:25:45,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:25:45,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:25:45,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:25:45,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,414 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-17 01:25:45,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:25:45,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:25:45,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:25:45,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:25:45,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,444 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-17 01:25:45,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:25:45,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:25:45,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:25:45,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:25:45,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (1/1) ... [2025-03-17 01:25:45,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:25:45,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:25:45,497 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-17 01:25:45,500 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-17 01:25:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:25:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:25:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:25:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:25:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:25:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:25:45,590 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:25:45,592 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:25:46,000 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:25:46,001 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:25:46,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:25:46,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:25:46,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:25:46 BoogieIcfgContainer [2025-03-17 01:25:46,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:25:46,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:25:46,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:25:46,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:25:46,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:25:45" (1/3) ... [2025-03-17 01:25:46,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acab7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:25:46, skipping insertion in model container [2025-03-17 01:25:46,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:25:45" (2/3) ... [2025-03-17 01:25:46,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acab7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:25:46, skipping insertion in model container [2025-03-17 01:25:46,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:25:46" (3/3) ... [2025-03-17 01:25:46,026 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i [2025-03-17 01:25:46,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:25:46,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-66.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:25:46,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:25:46,103 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;@453b364c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:25:46,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:25:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.54) internal successors, (77), 51 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 01:25:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 01:25:46,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:46,118 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:25:46,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:46,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1228021991, now seen corresponding path program 1 times [2025-03-17 01:25:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:46,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531241208] [2025-03-17 01:25:46,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:46,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 01:25:46,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 01:25:46,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:46,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:25:46,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531241208] [2025-03-17 01:25:46,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531241208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:25:46,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:25:46,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:25:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963697514] [2025-03-17 01:25:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:25:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:25:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:46,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:25:46,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:25:46,731 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.54) internal successors, (77), 51 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:25:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:46,813 INFO L93 Difference]: Finished difference Result 147 states and 262 transitions. [2025-03-17 01:25:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:25:46,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-17 01:25:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:46,822 INFO L225 Difference]: With dead ends: 147 [2025-03-17 01:25:46,823 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 01:25:46,826 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-17 01:25:46,828 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:46,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 102 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:25:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 01:25:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-17 01:25:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 01:25:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2025-03-17 01:25:46,861 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 145 [2025-03-17 01:25:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:46,864 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2025-03-17 01:25:46,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:25:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2025-03-17 01:25:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 01:25:46,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:46,870 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:25:46,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 01:25:46,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:46,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1256651142, now seen corresponding path program 1 times [2025-03-17 01:25:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748159272] [2025-03-17 01:25:46,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:46,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:46,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 01:25:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 01:25:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:46,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:25:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748159272] [2025-03-17 01:25:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748159272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:25:47,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:25:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:25:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529435839] [2025-03-17 01:25:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:25:47,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:25:47,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:47,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:25:47,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:25:47,392 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:25:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:47,767 INFO L93 Difference]: Finished difference Result 244 states and 396 transitions. [2025-03-17 01:25:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:25:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-17 01:25:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:47,770 INFO L225 Difference]: With dead ends: 244 [2025-03-17 01:25:47,770 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 01:25:47,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:25:47,771 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 142 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:47,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 436 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:25:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 01:25:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2025-03-17 01:25:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 01:25:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 211 transitions. [2025-03-17 01:25:47,803 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 211 transitions. Word has length 145 [2025-03-17 01:25:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:47,803 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 211 transitions. [2025-03-17 01:25:47,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:25:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 211 transitions. [2025-03-17 01:25:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 01:25:47,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:47,806 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:25:47,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:25:47,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 259578789, now seen corresponding path program 1 times [2025-03-17 01:25:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189630676] [2025-03-17 01:25:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:47,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 01:25:47,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 01:25:47,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:47,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:25:48,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:48,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189630676] [2025-03-17 01:25:48,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189630676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:25:48,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:25:48,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:25:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649208720] [2025-03-17 01:25:48,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:25:48,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:25:48,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:48,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:25:48,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:25:48,373 INFO L87 Difference]: Start difference. First operand 134 states and 211 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:25:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:48,688 INFO L93 Difference]: Finished difference Result 260 states and 411 transitions. [2025-03-17 01:25:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:25:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-17 01:25:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:48,691 INFO L225 Difference]: With dead ends: 260 [2025-03-17 01:25:48,692 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 01:25:48,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:25:48,693 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 193 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:48,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 193 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:25:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 01:25:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2025-03-17 01:25:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.476923076923077) internal successors, (192), 131 states have internal predecessors, (192), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:25:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2025-03-17 01:25:48,721 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 145 [2025-03-17 01:25:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:48,721 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2025-03-17 01:25:48,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 01:25:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2025-03-17 01:25:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:25:48,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:48,724 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:25:48,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:25:48,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:48,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash -36971964, now seen corresponding path program 1 times [2025-03-17 01:25:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914949736] [2025-03-17 01:25:48,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:48,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:25:48,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:25:48,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:25:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:25:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:25:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914949736] [2025-03-17 01:25:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914949736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:25:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:25:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:25:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013615232] [2025-03-17 01:25:52,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:25:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:25:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:25:52,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:25:52,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:25:52,518 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:25:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:25:53,454 INFO L93 Difference]: Finished difference Result 374 states and 574 transitions. [2025-03-17 01:25:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:25:53,454 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:25:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:25:53,458 INFO L225 Difference]: With dead ends: 374 [2025-03-17 01:25:53,458 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 01:25:53,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:25:53,459 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 223 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:25:53,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 417 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:25:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 01:25:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 214. [2025-03-17 01:25:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 159 states have internal predecessors, (231), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:25:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2025-03-17 01:25:53,483 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 146 [2025-03-17 01:25:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:25:53,483 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2025-03-17 01:25:53,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:25:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2025-03-17 01:25:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:25:53,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:25:53,486 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:25:53,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:25:53,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:25:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:25:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash -36942173, now seen corresponding path program 1 times [2025-03-17 01:25:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:25:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784632011] [2025-03-17 01:25:53,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:25:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:25:53,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:25:53,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:25:53,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:25:53,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784632011] [2025-03-17 01:26:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784632011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:17,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:26:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800325389] [2025-03-17 01:26:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:17,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:26:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:17,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:26:17,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:26:17,090 INFO L87 Difference]: Start difference. First operand 214 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:18,231 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2025-03-17 01:26:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:26:18,232 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:18,233 INFO L225 Difference]: With dead ends: 252 [2025-03-17 01:26:18,235 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 01:26:18,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:26:18,235 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 194 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:18,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 456 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:26:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 01:26:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 215. [2025-03-17 01:26:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 160 states have internal predecessors, (232), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:26:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 332 transitions. [2025-03-17 01:26:18,255 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 332 transitions. Word has length 146 [2025-03-17 01:26:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:18,255 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 332 transitions. [2025-03-17 01:26:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 332 transitions. [2025-03-17 01:26:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:18,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:18,256 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:26:18,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1833923323, now seen corresponding path program 1 times [2025-03-17 01:26:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630156072] [2025-03-17 01:26:18,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:18,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:18,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:18,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:21,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630156072] [2025-03-17 01:26:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630156072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:21,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:26:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245611151] [2025-03-17 01:26:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:26:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:21,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:26:21,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:26:21,132 INFO L87 Difference]: Start difference. First operand 215 states and 332 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:21,787 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2025-03-17 01:26:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:26:21,787 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:21,790 INFO L225 Difference]: With dead ends: 260 [2025-03-17 01:26:21,790 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 01:26:21,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:26:21,792 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 142 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:21,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 484 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:26:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 01:26:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 223. [2025-03-17 01:26:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 167 states have (on average 1.4550898203592815) internal successors, (243), 168 states have internal predecessors, (243), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:26:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2025-03-17 01:26:21,807 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 146 [2025-03-17 01:26:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2025-03-17 01:26:21,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2025-03-17 01:26:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:21,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:21,808 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:26:21,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1833893532, now seen corresponding path program 1 times [2025-03-17 01:26:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617322080] [2025-03-17 01:26:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:21,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:21,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:21,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:21,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617322080] [2025-03-17 01:26:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617322080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:26:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446630037] [2025-03-17 01:26:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:26:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:26,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:26:26,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:26:26,482 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:27,459 INFO L93 Difference]: Finished difference Result 258 states and 379 transitions. [2025-03-17 01:26:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:26:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:27,462 INFO L225 Difference]: With dead ends: 258 [2025-03-17 01:26:27,462 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 01:26:27,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:26:27,463 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 163 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:27,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 565 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:26:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 01:26:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2025-03-17 01:26:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 163 states have (on average 1.460122699386503) internal successors, (238), 164 states have internal predecessors, (238), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:26:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 338 transitions. [2025-03-17 01:26:27,484 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 338 transitions. Word has length 146 [2025-03-17 01:26:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:27,484 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 338 transitions. [2025-03-17 01:26:27,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 338 transitions. [2025-03-17 01:26:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:27,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:27,486 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:26:27,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:27,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -547506141, now seen corresponding path program 1 times [2025-03-17 01:26:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352631838] [2025-03-17 01:26:27,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:27,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:27,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:27,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352631838] [2025-03-17 01:26:27,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352631838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:26:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340102818] [2025-03-17 01:26:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:27,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:26:27,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:27,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:26:27,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:26:27,533 INFO L87 Difference]: Start difference. First operand 219 states and 338 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:27,577 INFO L93 Difference]: Finished difference Result 476 states and 729 transitions. [2025-03-17 01:26:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:26:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:27,579 INFO L225 Difference]: With dead ends: 476 [2025-03-17 01:26:27,579 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 01:26:27,580 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-17 01:26:27,580 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 98 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:27,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 303 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:26:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 01:26:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2025-03-17 01:26:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 235 states have (on average 1.3872340425531915) internal successors, (326), 237 states have internal predecessors, (326), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 01:26:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 482 transitions. [2025-03-17 01:26:27,607 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 482 transitions. Word has length 146 [2025-03-17 01:26:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:27,608 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 482 transitions. [2025-03-17 01:26:27,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 482 transitions. [2025-03-17 01:26:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:27,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:27,610 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:27,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:26:27,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:27,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash -744019646, now seen corresponding path program 1 times [2025-03-17 01:26:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:27,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482031393] [2025-03-17 01:26:27,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:27,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:27,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:27,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:27,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482031393] [2025-03-17 01:26:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482031393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:27,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:26:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996101422] [2025-03-17 01:26:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:27,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:26:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:27,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:26:27,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:26:27,687 INFO L87 Difference]: Start difference. First operand 322 states and 482 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:27,873 INFO L93 Difference]: Finished difference Result 737 states and 1081 transitions. [2025-03-17 01:26:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:26:27,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:27,877 INFO L225 Difference]: With dead ends: 737 [2025-03-17 01:26:27,878 INFO L226 Difference]: Without dead ends: 496 [2025-03-17 01:26:27,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:26:27,879 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 94 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:27,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 373 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:26:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-17 01:26:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 471. [2025-03-17 01:26:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 347 states have (on average 1.3631123919308357) internal successors, (473), 351 states have internal predecessors, (473), 110 states have call successors, (110), 13 states have call predecessors, (110), 13 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 01:26:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 693 transitions. [2025-03-17 01:26:27,953 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 693 transitions. Word has length 146 [2025-03-17 01:26:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:27,953 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 693 transitions. [2025-03-17 01:26:27,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 693 transitions. [2025-03-17 01:26:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:27,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:27,958 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:27,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:26:27,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:27,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1753996291, now seen corresponding path program 1 times [2025-03-17 01:26:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177044689] [2025-03-17 01:26:27,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:27,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:28,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:28,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:28,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177044689] [2025-03-17 01:26:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177044689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:26:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198861119] [2025-03-17 01:26:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:29,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:26:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:29,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:26:29,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:26:29,778 INFO L87 Difference]: Start difference. First operand 471 states and 693 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:30,454 INFO L93 Difference]: Finished difference Result 554 states and 785 transitions. [2025-03-17 01:26:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:26:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:30,460 INFO L225 Difference]: With dead ends: 554 [2025-03-17 01:26:30,460 INFO L226 Difference]: Without dead ends: 552 [2025-03-17 01:26:30,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:26:30,462 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 307 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:30,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 453 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:26:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-17 01:26:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 503. [2025-03-17 01:26:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 376 states have (on average 1.3537234042553192) internal successors, (509), 381 states have internal predecessors, (509), 112 states have call successors, (112), 14 states have call predecessors, (112), 14 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 01:26:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 733 transitions. [2025-03-17 01:26:30,512 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 733 transitions. Word has length 146 [2025-03-17 01:26:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:30,512 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 733 transitions. [2025-03-17 01:26:30,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 733 transitions. [2025-03-17 01:26:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:30,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:30,517 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:30,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:26:30,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:30,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1754026082, now seen corresponding path program 1 times [2025-03-17 01:26:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466483233] [2025-03-17 01:26:30,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:30,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:30,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:30,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:30,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466483233] [2025-03-17 01:26:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466483233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:33,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:26:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043257914] [2025-03-17 01:26:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:33,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:26:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:33,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:26:33,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:26:33,112 INFO L87 Difference]: Start difference. First operand 503 states and 733 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:34,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:34,903 INFO L93 Difference]: Finished difference Result 552 states and 783 transitions. [2025-03-17 01:26:34,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:26:34,904 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:34,907 INFO L225 Difference]: With dead ends: 552 [2025-03-17 01:26:34,907 INFO L226 Difference]: Without dead ends: 550 [2025-03-17 01:26:34,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:26:34,909 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 244 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:34,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 600 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 01:26:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-17 01:26:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 503. [2025-03-17 01:26:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 376 states have (on average 1.3537234042553192) internal successors, (509), 381 states have internal predecessors, (509), 112 states have call successors, (112), 14 states have call predecessors, (112), 14 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 01:26:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 733 transitions. [2025-03-17 01:26:34,951 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 733 transitions. Word has length 146 [2025-03-17 01:26:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:34,952 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 733 transitions. [2025-03-17 01:26:34,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 733 transitions. [2025-03-17 01:26:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 01:26:34,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:34,953 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:34,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:26:34,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash 961206048, now seen corresponding path program 1 times [2025-03-17 01:26:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737737260] [2025-03-17 01:26:34,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:34,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 01:26:34,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 01:26:34,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:34,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737737260] [2025-03-17 01:26:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737737260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:35,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 01:26:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130813847] [2025-03-17 01:26:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:35,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:26:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:35,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:26:35,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:26:35,555 INFO L87 Difference]: Start difference. First operand 503 states and 733 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:36,305 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2025-03-17 01:26:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:26:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-17 01:26:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:36,313 INFO L225 Difference]: With dead ends: 1330 [2025-03-17 01:26:36,314 INFO L226 Difference]: Without dead ends: 912 [2025-03-17 01:26:36,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:26:36,318 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 351 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:36,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 770 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:26:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-17 01:26:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 691. [2025-03-17 01:26:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 557 states have (on average 1.4201077199281866) internal successors, (791), 564 states have internal predecessors, (791), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 01:26:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1019 transitions. [2025-03-17 01:26:36,374 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1019 transitions. Word has length 146 [2025-03-17 01:26:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:36,374 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1019 transitions. [2025-03-17 01:26:36,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1019 transitions. [2025-03-17 01:26:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:26:36,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:36,375 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:36,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:26:36,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash -863995927, now seen corresponding path program 1 times [2025-03-17 01:26:36,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994668272] [2025-03-17 01:26:36,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:36,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:36,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:36,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-17 01:26:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994668272] [2025-03-17 01:26:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994668272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:26:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484708234] [2025-03-17 01:26:36,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:26:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:26:36,510 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-17 01:26:36,511 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-17 01:26:36,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:36,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:36,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:36,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:36,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:26:36,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:26:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 211 proven. 6 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2025-03-17 01:26:36,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:26:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-17 01:26:37,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484708234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:26:37,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:26:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2025-03-17 01:26:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108560504] [2025-03-17 01:26:37,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:26:37,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:26:37,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:37,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:26:37,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:26:37,012 INFO L87 Difference]: Start difference. First operand 691 states and 1019 transitions. Second operand has 14 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-17 01:26:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:37,586 INFO L93 Difference]: Finished difference Result 1725 states and 2508 transitions. [2025-03-17 01:26:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 01:26:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) Word has length 147 [2025-03-17 01:26:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:37,594 INFO L225 Difference]: With dead ends: 1725 [2025-03-17 01:26:37,594 INFO L226 Difference]: Without dead ends: 1134 [2025-03-17 01:26:37,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:26:37,597 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 284 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:37,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 376 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:26:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-17 01:26:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1107. [2025-03-17 01:26:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 884 states have (on average 1.3585972850678734) internal successors, (1201), 900 states have internal predecessors, (1201), 188 states have call successors, (188), 34 states have call predecessors, (188), 34 states have return successors, (188), 172 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-17 01:26:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1577 transitions. [2025-03-17 01:26:37,730 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1577 transitions. Word has length 147 [2025-03-17 01:26:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:37,730 INFO L471 AbstractCegarLoop]: Abstraction has 1107 states and 1577 transitions. [2025-03-17 01:26:37,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 6 states have call successors, (66), 3 states have call predecessors, (66), 6 states have return successors, (66), 6 states have call predecessors, (66), 6 states have call successors, (66) [2025-03-17 01:26:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1577 transitions. [2025-03-17 01:26:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:26:37,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:37,732 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:37,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:26:37,935 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,SelfDestructingSolverStorable12 [2025-03-17 01:26:37,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:37,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1995114507, now seen corresponding path program 1 times [2025-03-17 01:26:37,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:37,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139003723] [2025-03-17 01:26:37,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:37,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:37,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:37,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-17 01:26:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139003723] [2025-03-17 01:26:38,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139003723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:26:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345843603] [2025-03-17 01:26:38,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:38,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:26:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:26:38,117 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-17 01:26:38,118 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-17 01:26:38,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:38,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:38,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:38,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:38,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:26:38,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:26:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-17 01:26:38,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:26:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-17 01:26:38,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345843603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:26:38,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:26:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 01:26:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639615418] [2025-03-17 01:26:38,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:26:38,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:26:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:38,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:26:38,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:26:38,450 INFO L87 Difference]: Start difference. First operand 1107 states and 1577 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-17 01:26:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:38,673 INFO L93 Difference]: Finished difference Result 2154 states and 3035 transitions. [2025-03-17 01:26:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:26:38,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 147 [2025-03-17 01:26:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:38,681 INFO L225 Difference]: With dead ends: 2154 [2025-03-17 01:26:38,681 INFO L226 Difference]: Without dead ends: 1149 [2025-03-17 01:26:38,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:26:38,684 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 167 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:38,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 205 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:26:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-17 01:26:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1135. [2025-03-17 01:26:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 905 states have (on average 1.3259668508287292) internal successors, (1200), 921 states have internal predecessors, (1200), 188 states have call successors, (188), 41 states have call predecessors, (188), 41 states have return successors, (188), 172 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-17 01:26:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1576 transitions. [2025-03-17 01:26:38,788 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1576 transitions. Word has length 147 [2025-03-17 01:26:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:38,789 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1576 transitions. [2025-03-17 01:26:38,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-17 01:26:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1576 transitions. [2025-03-17 01:26:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:26:38,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:38,790 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:38,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:26:38,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 01:26:38,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:38,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash 998042154, now seen corresponding path program 1 times [2025-03-17 01:26:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18556454] [2025-03-17 01:26:38,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:39,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:39,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:39,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:39,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:39,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18556454] [2025-03-17 01:26:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18556454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:39,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:39,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:26:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888539547] [2025-03-17 01:26:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:39,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:26:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:39,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:26:39,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:26:39,251 INFO L87 Difference]: Start difference. First operand 1135 states and 1576 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:39,664 INFO L93 Difference]: Finished difference Result 1934 states and 2680 transitions. [2025-03-17 01:26:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:26:39,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-17 01:26:39,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:39,672 INFO L225 Difference]: With dead ends: 1934 [2025-03-17 01:26:39,672 INFO L226 Difference]: Without dead ends: 1155 [2025-03-17 01:26:39,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:26:39,676 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 115 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:39,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 382 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:26:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-17 01:26:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1135. [2025-03-17 01:26:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 904 states have (on average 1.323008849557522) internal successors, (1196), 920 states have internal predecessors, (1196), 188 states have call successors, (188), 42 states have call predecessors, (188), 42 states have return successors, (188), 172 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-17 01:26:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1572 transitions. [2025-03-17 01:26:39,801 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1572 transitions. Word has length 147 [2025-03-17 01:26:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1572 transitions. [2025-03-17 01:26:39,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 01:26:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1572 transitions. [2025-03-17 01:26:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:26:39,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:39,803 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:26:39,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:39,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1363865656, now seen corresponding path program 1 times [2025-03-17 01:26:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143080512] [2025-03-17 01:26:39,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:39,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:39,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:39,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:26:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 01:26:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:26:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143080512] [2025-03-17 01:26:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143080512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:26:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:26:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 01:26:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739736807] [2025-03-17 01:26:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:26:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 01:26:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:26:44,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 01:26:44,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-03-17 01:26:44,434 INFO L87 Difference]: Start difference. First operand 1135 states and 1572 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-17 01:26:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:26:47,303 INFO L93 Difference]: Finished difference Result 1818 states and 2533 transitions. [2025-03-17 01:26:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 01:26:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 147 [2025-03-17 01:26:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:26:47,310 INFO L225 Difference]: With dead ends: 1818 [2025-03-17 01:26:47,310 INFO L226 Difference]: Without dead ends: 1370 [2025-03-17 01:26:47,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 01:26:47,312 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 477 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:26:47,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 658 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 01:26:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-17 01:26:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1179. [2025-03-17 01:26:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 948 states have (on average 1.3270042194092826) internal successors, (1258), 964 states have internal predecessors, (1258), 188 states have call successors, (188), 42 states have call predecessors, (188), 42 states have return successors, (188), 172 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-17 01:26:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1634 transitions. [2025-03-17 01:26:47,429 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1634 transitions. Word has length 147 [2025-03-17 01:26:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:26:47,430 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1634 transitions. [2025-03-17 01:26:47,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-17 01:26:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1634 transitions. [2025-03-17 01:26:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 01:26:47,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:26:47,433 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:26:47,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:26:47,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:26:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:26:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1363835865, now seen corresponding path program 1 times [2025-03-17 01:26:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:26:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779123977] [2025-03-17 01:26:47,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:26:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:26:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 01:26:47,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 01:26:47,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:26:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat