./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.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 d2ac2ade0b5a8b4fe781342f1619d7dd5e5c5b8a1b1139b842ae9332f648993d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:07:38,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:07:38,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:07:38,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:07:38,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:07:38,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:07:38,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:07:38,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:07:38,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:07:38,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:07:38,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:07:38,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:07:38,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:07:38,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:07:38,316 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:07:38,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:07:38,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:07:38,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:07:38,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:07:38,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:38,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:07:38,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:07:38,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:07:38,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:07:38,319 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 -> d2ac2ade0b5a8b4fe781342f1619d7dd5e5c5b8a1b1139b842ae9332f648993d [2025-03-03 20:07:38,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:07:38,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:07:38,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:07:38,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:07:38,559 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:07:38,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i [2025-03-03 20:07:39,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91d21087/48630372a51f4e9f80a735c7bf702fb5/FLAG18e15f24f [2025-03-03 20:07:39,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:07:39,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i [2025-03-03 20:07:39,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91d21087/48630372a51f4e9f80a735c7bf702fb5/FLAG18e15f24f [2025-03-03 20:07:39,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91d21087/48630372a51f4e9f80a735c7bf702fb5 [2025-03-03 20:07:39,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:07:39,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:07:39,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:39,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:07:39,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:07:39,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:39" (1/1) ... [2025-03-03 20:07:39,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:39, skipping insertion in model container [2025-03-03 20:07:39,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:39" (1/1) ... [2025-03-03 20:07:40,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:07:40,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i[916,929] [2025-03-03 20:07:40,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:40,317 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:07:40,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i[916,929] [2025-03-03 20:07:40,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:40,402 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:07:40,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40 WrapperNode [2025-03-03 20:07:40,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:40,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:40,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:07:40,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:07:40,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,513 INFO L138 Inliner]: procedures = 26, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 872 [2025-03-03 20:07:40,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:40,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:07:40,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:07:40,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:07:40,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,580 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:07:40,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:07:40,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:07:40,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:07:40,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:07:40,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (1/1) ... [2025-03-03 20:07:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:40,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:40,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:07:40,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:07:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:07:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:07:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:07:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:07:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:07:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:07:40,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:07:40,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:07:41,952 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 20:07:41,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:07:41,991 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:07:41,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:07:41,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:41 BoogieIcfgContainer [2025-03-03 20:07:41,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:07:41,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:07:41,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:07:42,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:07:42,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:07:39" (1/3) ... [2025-03-03 20:07:42,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bee4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:42, skipping insertion in model container [2025-03-03 20:07:42,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:40" (2/3) ... [2025-03-03 20:07:42,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bee4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:42, skipping insertion in model container [2025-03-03 20:07:42,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:41" (3/3) ... [2025-03-03 20:07:42,005 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-37.i [2025-03-03 20:07:42,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:07:42,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-37.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:07:42,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:07:42,091 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;@66eff637, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:07:42,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:07:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 234 states have (on average 1.564102564102564) internal successors, (366), 235 states have internal predecessors, (366), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-03 20:07:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:42,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:42,134 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:42,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1484958113, now seen corresponding path program 1 times [2025-03-03 20:07:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095919366] [2025-03-03 20:07:42,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:42,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:42,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:42,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-03-03 20:07:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:42,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095919366] [2025-03-03 20:07:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095919366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181995366] [2025-03-03 20:07:42,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:42,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:42,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:07:42,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:07:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:43,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:43,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:43,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:07:43,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-03-03 20:07:43,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:07:43,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181995366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:43,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:07:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:07:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751407029] [2025-03-03 20:07:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:43,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:07:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:43,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:07:43,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:43,415 INFO L87 Difference]: Start difference. First operand has 362 states, 234 states have (on average 1.564102564102564) internal successors, (366), 235 states have internal predecessors, (366), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 20:07:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:43,518 INFO L93 Difference]: Finished difference Result 718 states and 1352 transitions. [2025-03-03 20:07:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:07:43,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) Word has length 790 [2025-03-03 20:07:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:43,530 INFO L225 Difference]: With dead ends: 718 [2025-03-03 20:07:43,531 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 20:07:43,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 791 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:43,541 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:43,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 20:07:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-03 20:07:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 232 states have (on average 1.5387931034482758) internal successors, (357), 232 states have internal predecessors, (357), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-03 20:07:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 607 transitions. [2025-03-03 20:07:43,630 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 607 transitions. Word has length 790 [2025-03-03 20:07:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:43,630 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 607 transitions. [2025-03-03 20:07:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 20:07:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 607 transitions. [2025-03-03 20:07:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:43,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:43,643 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:43,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:07:43,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:07:43,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:43,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1097921479, now seen corresponding path program 1 times [2025-03-03 20:07:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429424698] [2025-03-03 20:07:43,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:44,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:44,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:44,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429424698] [2025-03-03 20:07:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429424698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:44,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673616086] [2025-03-03 20:07:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:44,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:44,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:44,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:44,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:44,711 INFO L87 Difference]: Start difference. First operand 359 states and 607 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:44,817 INFO L93 Difference]: Finished difference Result 911 states and 1547 transitions. [2025-03-03 20:07:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:44,826 INFO L225 Difference]: With dead ends: 911 [2025-03-03 20:07:44,827 INFO L226 Difference]: Without dead ends: 555 [2025-03-03 20:07:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:44,829 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 330 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:44,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1376 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-03 20:07:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2025-03-03 20:07:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 384 states have (on average 1.5859375) internal successors, (609), 385 states have internal predecessors, (609), 165 states have call successors, (165), 2 states have call predecessors, (165), 2 states have return successors, (165), 164 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-03 20:07:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 939 transitions. [2025-03-03 20:07:44,899 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 939 transitions. Word has length 790 [2025-03-03 20:07:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:44,901 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 939 transitions. [2025-03-03 20:07:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 939 transitions. [2025-03-03 20:07:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:44,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:44,917 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:44,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:07:44,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:44,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 526670246, now seen corresponding path program 1 times [2025-03-03 20:07:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:44,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242986682] [2025-03-03 20:07:44,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:44,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:45,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:45,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:45,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242986682] [2025-03-03 20:07:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242986682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:45,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716294206] [2025-03-03 20:07:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:45,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:45,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:45,270 INFO L87 Difference]: Start difference. First operand 552 states and 939 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:45,376 INFO L93 Difference]: Finished difference Result 1420 states and 2414 transitions. [2025-03-03 20:07:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:45,391 INFO L225 Difference]: With dead ends: 1420 [2025-03-03 20:07:45,391 INFO L226 Difference]: Without dead ends: 871 [2025-03-03 20:07:45,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:45,396 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 268 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:45,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1285 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-03 20:07:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 868. [2025-03-03 20:07:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 614 states have (on average 1.5830618892508144) internal successors, (972), 617 states have internal predecessors, (972), 249 states have call successors, (249), 4 states have call predecessors, (249), 4 states have return successors, (249), 246 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-03 20:07:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1470 transitions. [2025-03-03 20:07:45,485 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1470 transitions. Word has length 790 [2025-03-03 20:07:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:45,489 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1470 transitions. [2025-03-03 20:07:45,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1470 transitions. [2025-03-03 20:07:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:45,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:45,500 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:45,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:07:45,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:45,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:45,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1842763739, now seen corresponding path program 1 times [2025-03-03 20:07:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463128138] [2025-03-03 20:07:45,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:45,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:45,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:45,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:45,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463128138] [2025-03-03 20:07:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463128138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:45,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307533315] [2025-03-03 20:07:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:45,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:45,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:45,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:45,842 INFO L87 Difference]: Start difference. First operand 868 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:45,927 INFO L93 Difference]: Finished difference Result 1745 states and 2946 transitions. [2025-03-03 20:07:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:45,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:45,936 INFO L225 Difference]: With dead ends: 1745 [2025-03-03 20:07:45,936 INFO L226 Difference]: Without dead ends: 880 [2025-03-03 20:07:45,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:45,940 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 301 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:45,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1186 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-03 20:07:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 618. [2025-03-03 20:07:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 444 states have (on average 1.5833333333333333) internal successors, (703), 445 states have internal predecessors, (703), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 168 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-03 20:07:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1041 transitions. [2025-03-03 20:07:46,001 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1041 transitions. Word has length 790 [2025-03-03 20:07:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:46,002 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 1041 transitions. [2025-03-03 20:07:46,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1041 transitions. [2025-03-03 20:07:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:46,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:46,011 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:46,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:07:46,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:46,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 751463078, now seen corresponding path program 1 times [2025-03-03 20:07:46,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:46,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629149414] [2025-03-03 20:07:46,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:46,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:46,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:46,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:46,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629149414] [2025-03-03 20:07:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629149414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763851345] [2025-03-03 20:07:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:46,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:46,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:46,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:46,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:46,352 INFO L87 Difference]: Start difference. First operand 618 states and 1041 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:46,451 INFO L93 Difference]: Finished difference Result 1690 states and 2861 transitions. [2025-03-03 20:07:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:46,459 INFO L225 Difference]: With dead ends: 1690 [2025-03-03 20:07:46,459 INFO L226 Difference]: Without dead ends: 1075 [2025-03-03 20:07:46,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:46,461 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 308 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:46,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1278 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-03 20:07:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1071. [2025-03-03 20:07:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 819 states have (on average 1.6166056166056166) internal successors, (1324), 822 states have internal predecessors, (1324), 245 states have call successors, (245), 6 states have call predecessors, (245), 6 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-03 20:07:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1814 transitions. [2025-03-03 20:07:46,513 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1814 transitions. Word has length 790 [2025-03-03 20:07:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:46,516 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1814 transitions. [2025-03-03 20:07:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1814 transitions. [2025-03-03 20:07:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:46,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:46,523 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:46,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:07:46,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:46,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1947939800, now seen corresponding path program 1 times [2025-03-03 20:07:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242342775] [2025-03-03 20:07:46,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:46,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:46,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:46,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:46,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242342775] [2025-03-03 20:07:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242342775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538212305] [2025-03-03 20:07:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:46,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:46,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:46,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:46,814 INFO L87 Difference]: Start difference. First operand 1071 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:46,929 INFO L93 Difference]: Finished difference Result 3017 states and 5112 transitions. [2025-03-03 20:07:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:46,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:46,941 INFO L225 Difference]: With dead ends: 3017 [2025-03-03 20:07:46,941 INFO L226 Difference]: Without dead ends: 1949 [2025-03-03 20:07:46,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:46,946 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 280 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:46,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1280 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-03-03 20:07:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1945. [2025-03-03 20:07:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1527 states have (on average 1.618860510805501) internal successors, (2472), 1534 states have internal predecessors, (2472), 405 states have call successors, (405), 12 states have call predecessors, (405), 12 states have return successors, (405), 398 states have call predecessors, (405), 405 states have call successors, (405) [2025-03-03 20:07:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3282 transitions. [2025-03-03 20:07:47,055 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3282 transitions. Word has length 790 [2025-03-03 20:07:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:47,057 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 3282 transitions. [2025-03-03 20:07:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3282 transitions. [2025-03-03 20:07:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:47,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:47,064 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:47,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:07:47,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1835244889, now seen corresponding path program 1 times [2025-03-03 20:07:47,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:47,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247496816] [2025-03-03 20:07:47,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:47,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:47,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:47,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:47,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:47,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247496816] [2025-03-03 20:07:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247496816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828838723] [2025-03-03 20:07:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:47,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:47,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:47,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:47,334 INFO L87 Difference]: Start difference. First operand 1945 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:47,490 INFO L93 Difference]: Finished difference Result 4835 states and 8082 transitions. [2025-03-03 20:07:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:47,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:47,509 INFO L225 Difference]: With dead ends: 4835 [2025-03-03 20:07:47,510 INFO L226 Difference]: Without dead ends: 2893 [2025-03-03 20:07:47,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:47,517 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 183 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:47,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1295 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2025-03-03 20:07:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2890. [2025-03-03 20:07:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2134 states have (on average 1.5534208059981256) internal successors, (3315), 2149 states have internal predecessors, (3315), 731 states have call successors, (731), 24 states have call predecessors, (731), 24 states have return successors, (731), 716 states have call predecessors, (731), 731 states have call successors, (731) [2025-03-03 20:07:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4777 transitions. [2025-03-03 20:07:47,694 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4777 transitions. Word has length 790 [2025-03-03 20:07:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:47,695 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 4777 transitions. [2025-03-03 20:07:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4777 transitions. [2025-03-03 20:07:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:47,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:47,707 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:47,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:07:47,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:47,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1106412710, now seen corresponding path program 1 times [2025-03-03 20:07:47,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:47,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556224136] [2025-03-03 20:07:47,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:47,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:47,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:47,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556224136] [2025-03-03 20:07:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556224136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:48,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:48,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368137465] [2025-03-03 20:07:48,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:48,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:48,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:48,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:48,286 INFO L87 Difference]: Start difference. First operand 2890 states and 4777 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:48,731 INFO L93 Difference]: Finished difference Result 8528 states and 14101 transitions. [2025-03-03 20:07:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:48,766 INFO L225 Difference]: With dead ends: 8528 [2025-03-03 20:07:48,766 INFO L226 Difference]: Without dead ends: 5641 [2025-03-03 20:07:48,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:48,780 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 375 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:48,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 2302 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:07:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2025-03-03 20:07:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5638. [2025-03-03 20:07:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 4198 states have (on average 1.556693663649357) internal successors, (6535), 4229 states have internal predecessors, (6535), 1391 states have call successors, (1391), 48 states have call predecessors, (1391), 48 states have return successors, (1391), 1360 states have call predecessors, (1391), 1391 states have call successors, (1391) [2025-03-03 20:07:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 9317 transitions. [2025-03-03 20:07:49,142 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 9317 transitions. Word has length 790 [2025-03-03 20:07:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:49,143 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 9317 transitions. [2025-03-03 20:07:49,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 9317 transitions. [2025-03-03 20:07:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:49,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:49,158 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:07:49,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:49,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1980636411, now seen corresponding path program 1 times [2025-03-03 20:07:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884797463] [2025-03-03 20:07:49,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:49,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:49,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:49,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:49,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884797463] [2025-03-03 20:07:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884797463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054998394] [2025-03-03 20:07:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:50,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:50,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:50,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:50,547 INFO L87 Difference]: Start difference. First operand 5638 states and 9317 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:51,381 INFO L93 Difference]: Finished difference Result 13515 states and 22236 transitions. [2025-03-03 20:07:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:51,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:51,421 INFO L225 Difference]: With dead ends: 13515 [2025-03-03 20:07:51,421 INFO L226 Difference]: Without dead ends: 7880 [2025-03-03 20:07:51,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:51,437 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 1049 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:51,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 2126 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:07:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2025-03-03 20:07:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 6094. [2025-03-03 20:07:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 4654 states have (on average 1.5653201547056295) internal successors, (7285), 4685 states have internal predecessors, (7285), 1391 states have call successors, (1391), 48 states have call predecessors, (1391), 48 states have return successors, (1391), 1360 states have call predecessors, (1391), 1391 states have call successors, (1391) [2025-03-03 20:07:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 10067 transitions. [2025-03-03 20:07:51,730 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 10067 transitions. Word has length 790 [2025-03-03 20:07:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:51,731 INFO L471 AbstractCegarLoop]: Abstraction has 6094 states and 10067 transitions. [2025-03-03 20:07:51,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 10067 transitions. [2025-03-03 20:07:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-03 20:07:51,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:51,742 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:51,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:07:51,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:51,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash 880812739, now seen corresponding path program 1 times [2025-03-03 20:07:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788155849] [2025-03-03 20:07:51,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:51,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-03 20:07:51,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-03 20:07:51,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:51,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:07:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788155849] [2025-03-03 20:07:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788155849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:52,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474152703] [2025-03-03 20:07:52,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:52,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:52,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:52,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:52,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:52,459 INFO L87 Difference]: Start difference. First operand 6094 states and 10067 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:53,300 INFO L93 Difference]: Finished difference Result 18276 states and 30195 transitions. [2025-03-03 20:07:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-03 20:07:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:53,368 INFO L225 Difference]: With dead ends: 18276 [2025-03-03 20:07:53,369 INFO L226 Difference]: Without dead ends: 12185 [2025-03-03 20:07:53,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:53,389 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 584 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:53,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1710 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2025-03-03 20:07:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 12181. [2025-03-03 20:07:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12181 states, 9302 states have (on average 1.5624596860890132) internal successors, (14534), 9364 states have internal predecessors, (14534), 2782 states have call successors, (2782), 96 states have call predecessors, (2782), 96 states have return successors, (2782), 2720 states have call predecessors, (2782), 2782 states have call successors, (2782) [2025-03-03 20:07:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 20098 transitions. [2025-03-03 20:07:54,416 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 20098 transitions. Word has length 790 [2025-03-03 20:07:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:54,417 INFO L471 AbstractCegarLoop]: Abstraction has 12181 states and 20098 transitions. [2025-03-03 20:07:54,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:07:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 20098 transitions. [2025-03-03 20:07:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 20:07:54,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:54,432 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:07:54,433 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -270332187, now seen corresponding path program 1 times [2025-03-03 20:07:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286892468] [2025-03-03 20:07:54,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:54,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:07:54,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:07:54,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:54,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 135 proven. 237 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-03 20:07:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286892468] [2025-03-03 20:07:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286892468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020119806] [2025-03-03 20:07:55,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:55,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:55,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:07:55,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:07:55,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:07:55,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:07:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:55,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:55,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 20:07:55,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 11464 proven. 282 refuted. 0 times theorem prover too weak. 19254 trivial. 0 not checked. [2025-03-03 20:07:57,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:07:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 90 proven. 282 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-03 20:07:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020119806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:07:58,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:07:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 11] total 23 [2025-03-03 20:07:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338254968] [2025-03-03 20:07:58,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:07:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 20:07:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:58,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 20:07:58,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-03 20:07:58,958 INFO L87 Difference]: Start difference. First operand 12181 states and 20098 transitions. Second operand has 23 states, 23 states have (on average 19.73913043478261) internal successors, (454), 23 states have internal predecessors, (454), 6 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 6 states have call predecessors, (375), 6 states have call successors, (375) [2025-03-03 20:08:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:10,347 INFO L93 Difference]: Finished difference Result 88650 states and 146017 transitions. [2025-03-03 20:08:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-03 20:08:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 19.73913043478261) internal successors, (454), 23 states have internal predecessors, (454), 6 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 6 states have call predecessors, (375), 6 states have call successors, (375) Word has length 791 [2025-03-03 20:08:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:10,626 INFO L225 Difference]: With dead ends: 88650 [2025-03-03 20:08:10,626 INFO L226 Difference]: Without dead ends: 76472 [2025-03-03 20:08:10,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1698 GetRequests, 1577 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5335 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2826, Invalid=12180, Unknown=0, NotChecked=0, Total=15006 [2025-03-03 20:08:10,688 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 9382 mSDsluCounter, 7121 mSDsCounter, 0 mSdLazyCounter, 7793 mSolverCounterSat, 3261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9415 SdHoareTripleChecker+Valid, 8119 SdHoareTripleChecker+Invalid, 11054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3261 IncrementalHoareTripleChecker+Valid, 7793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:10,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9415 Valid, 8119 Invalid, 11054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3261 Valid, 7793 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-03 20:08:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76472 states. [2025-03-03 20:08:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76472 to 30201. [2025-03-03 20:08:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30201 states, 23370 states have (on average 1.553872486093282) internal successors, (36314), 23524 states have internal predecessors, (36314), 6418 states have call successors, (6418), 412 states have call predecessors, (6418), 412 states have return successors, (6418), 6264 states have call predecessors, (6418), 6418 states have call successors, (6418) [2025-03-03 20:08:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30201 states to 30201 states and 49150 transitions. [2025-03-03 20:08:13,776 INFO L78 Accepts]: Start accepts. Automaton has 30201 states and 49150 transitions. Word has length 791 [2025-03-03 20:08:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:13,778 INFO L471 AbstractCegarLoop]: Abstraction has 30201 states and 49150 transitions. [2025-03-03 20:08:13,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 19.73913043478261) internal successors, (454), 23 states have internal predecessors, (454), 6 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 6 states have call predecessors, (375), 6 states have call successors, (375) [2025-03-03 20:08:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30201 states and 49150 transitions. [2025-03-03 20:08:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 20:08:13,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:13,805 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:13,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:08:14,005 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,SelfDestructingSolverStorable10 [2025-03-03 20:08:14,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:14,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1172718251, now seen corresponding path program 1 times [2025-03-03 20:08:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450265973] [2025-03-03 20:08:14,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:14,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:08:14,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:08:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:08:14,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:14,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450265973] [2025-03-03 20:08:14,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450265973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:14,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:14,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:08:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354893328] [2025-03-03 20:08:14,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:14,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:14,883 INFO L87 Difference]: Start difference. First operand 30201 states and 49150 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:08:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:17,685 INFO L93 Difference]: Finished difference Result 67843 states and 110165 transitions. [2025-03-03 20:08:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:08:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 791 [2025-03-03 20:08:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:17,846 INFO L225 Difference]: With dead ends: 67843 [2025-03-03 20:08:17,847 INFO L226 Difference]: Without dead ends: 37165 [2025-03-03 20:08:17,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:17,923 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 1280 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:17,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2241 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:08:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37165 states. [2025-03-03 20:08:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37165 to 26709. [2025-03-03 20:08:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26709 states, 23002 states have (on average 1.6138596643770107) internal successors, (37122), 23076 states have internal predecessors, (37122), 3482 states have call successors, (3482), 224 states have call predecessors, (3482), 224 states have return successors, (3482), 3408 states have call predecessors, (3482), 3482 states have call successors, (3482) [2025-03-03 20:08:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26709 states to 26709 states and 44086 transitions. [2025-03-03 20:08:19,433 INFO L78 Accepts]: Start accepts. Automaton has 26709 states and 44086 transitions. Word has length 791 [2025-03-03 20:08:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:19,434 INFO L471 AbstractCegarLoop]: Abstraction has 26709 states and 44086 transitions. [2025-03-03 20:08:19,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:08:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 26709 states and 44086 transitions. [2025-03-03 20:08:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 20:08:19,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:19,458 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:08:19,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 672116782, now seen corresponding path program 1 times [2025-03-03 20:08:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121843004] [2025-03-03 20:08:19,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:19,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:08:19,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:08:19,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:19,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-03 20:08:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121843004] [2025-03-03 20:08:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121843004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391733037] [2025-03-03 20:08:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:19,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:19,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:19,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:19,996 INFO L87 Difference]: Start difference. First operand 26709 states and 44086 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:08:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:21,237 INFO L93 Difference]: Finished difference Result 73123 states and 121660 transitions. [2025-03-03 20:08:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 791 [2025-03-03 20:08:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:21,346 INFO L225 Difference]: With dead ends: 73123 [2025-03-03 20:08:21,347 INFO L226 Difference]: Without dead ends: 46417 [2025-03-03 20:08:21,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:21,402 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 797 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:21,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2436 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:08:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2025-03-03 20:08:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 26784. [2025-03-03 20:08:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26784 states, 23034 states have (on average 1.606060606060606) internal successors, (36994), 23109 states have internal predecessors, (36994), 3522 states have call successors, (3522), 227 states have call predecessors, (3522), 227 states have return successors, (3522), 3447 states have call predecessors, (3522), 3522 states have call successors, (3522) [2025-03-03 20:08:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26784 states to 26784 states and 44038 transitions. [2025-03-03 20:08:22,758 INFO L78 Accepts]: Start accepts. Automaton has 26784 states and 44038 transitions. Word has length 791 [2025-03-03 20:08:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:22,759 INFO L471 AbstractCegarLoop]: Abstraction has 26784 states and 44038 transitions. [2025-03-03 20:08:22,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-03 20:08:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 26784 states and 44038 transitions. [2025-03-03 20:08:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 20:08:22,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:22,779 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:22,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:08:22,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:22,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash -324955571, now seen corresponding path program 1 times [2025-03-03 20:08:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006745398] [2025-03-03 20:08:22,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:22,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:08:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:08:22,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:22,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-03 20:08:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006745398] [2025-03-03 20:08:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006745398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56902222] [2025-03-03 20:08:24,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:24,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:24,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:08:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:08:24,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:08:24,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:24,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:24,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:08:24,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 15624 proven. 186 refuted. 0 times theorem prover too weak. 15190 trivial. 0 not checked. [2025-03-03 20:08:25,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-03 20:08:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56902222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:26,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 19 [2025-03-03 20:08:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085475141] [2025-03-03 20:08:26,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:26,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 20:08:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:26,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 20:08:26,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-03 20:08:26,687 INFO L87 Difference]: Start difference. First operand 26784 states and 44038 transitions. Second operand has 19 states, 19 states have (on average 18.57894736842105) internal successors, (353), 19 states have internal predecessors, (353), 5 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 5 states have call predecessors, (375), 5 states have call successors, (375) [2025-03-03 20:08:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:35,060 INFO L93 Difference]: Finished difference Result 89712 states and 147782 transitions. [2025-03-03 20:08:35,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 20:08:35,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.57894736842105) internal successors, (353), 19 states have internal predecessors, (353), 5 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 5 states have call predecessors, (375), 5 states have call successors, (375) Word has length 791 [2025-03-03 20:08:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:35,211 INFO L225 Difference]: With dead ends: 89712 [2025-03-03 20:08:35,211 INFO L226 Difference]: Without dead ends: 63006 [2025-03-03 20:08:35,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1634 GetRequests, 1579 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=608, Invalid=2584, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 20:08:35,254 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 4764 mSDsluCounter, 9686 mSDsCounter, 0 mSdLazyCounter, 6964 mSolverCounterSat, 2255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 10310 SdHoareTripleChecker+Invalid, 9219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2255 IncrementalHoareTripleChecker+Valid, 6964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:35,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 10310 Invalid, 9219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2255 Valid, 6964 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 20:08:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63006 states. [2025-03-03 20:08:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63006 to 43526. [2025-03-03 20:08:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43526 states, 36802 states have (on average 1.5904570403782403) internal successors, (58532), 36919 states have internal predecessors, (58532), 6428 states have call successors, (6428), 295 states have call predecessors, (6428), 295 states have return successors, (6428), 6311 states have call predecessors, (6428), 6428 states have call successors, (6428) [2025-03-03 20:08:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43526 states to 43526 states and 71388 transitions. [2025-03-03 20:08:37,902 INFO L78 Accepts]: Start accepts. Automaton has 43526 states and 71388 transitions. Word has length 791 [2025-03-03 20:08:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:37,903 INFO L471 AbstractCegarLoop]: Abstraction has 43526 states and 71388 transitions. [2025-03-03 20:08:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.57894736842105) internal successors, (353), 19 states have internal predecessors, (353), 5 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 5 states have call predecessors, (375), 5 states have call successors, (375) [2025-03-03 20:08:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 43526 states and 71388 transitions. [2025-03-03 20:08:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-03 20:08:37,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:37,928 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:37,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:08:38,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:38,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:38,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -311422770, now seen corresponding path program 1 times [2025-03-03 20:08:38,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:38,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897972389] [2025-03-03 20:08:38,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:38,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:08:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:08:38,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:38,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-03 20:08:38,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897972389] [2025-03-03 20:08:38,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897972389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397052522] [2025-03-03 20:08:38,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:38,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:38,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:38,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:38,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:08:38,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-03 20:08:39,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-03 20:08:39,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:39,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:39,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:08:39,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 17704 proven. 186 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2025-03-03 20:08:39,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-03 20:08:40,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397052522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:40,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:40,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 20:08:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438908272] [2025-03-03 20:08:40,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:08:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:08:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:08:40,495 INFO L87 Difference]: Start difference. First operand 43526 states and 71388 transitions. Second operand has 11 states, 11 states have (on average 25.181818181818183) internal successors, (277), 11 states have internal predecessors, (277), 6 states have call successors, (249), 3 states have call predecessors, (249), 5 states have return successors, (250), 6 states have call predecessors, (250), 6 states have call successors, (250) [2025-03-03 20:08:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:43,076 INFO L93 Difference]: Finished difference Result 87594 states and 143261 transitions. [2025-03-03 20:08:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:08:43,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.181818181818183) internal successors, (277), 11 states have internal predecessors, (277), 6 states have call successors, (249), 3 states have call predecessors, (249), 5 states have return successors, (250), 6 states have call predecessors, (250), 6 states have call successors, (250) Word has length 791 [2025-03-03 20:08:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:43,197 INFO L225 Difference]: With dead ends: 87594 [2025-03-03 20:08:43,197 INFO L226 Difference]: Without dead ends: 44146 [2025-03-03 20:08:43,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1592 GetRequests, 1577 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:08:43,252 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 652 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:43,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1129 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:08:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44146 states. [2025-03-03 20:08:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44146 to 43606. [2025-03-03 20:08:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43606 states, 36862 states have (on average 1.5790787260593566) internal successors, (58208), 36979 states have internal predecessors, (58208), 6428 states have call successors, (6428), 315 states have call predecessors, (6428), 315 states have return successors, (6428), 6311 states have call predecessors, (6428), 6428 states have call successors, (6428) [2025-03-03 20:08:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43606 states to 43606 states and 71064 transitions. [2025-03-03 20:08:45,925 INFO L78 Accepts]: Start accepts. Automaton has 43606 states and 71064 transitions. Word has length 791 [2025-03-03 20:08:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:45,926 INFO L471 AbstractCegarLoop]: Abstraction has 43606 states and 71064 transitions. [2025-03-03 20:08:45,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.181818181818183) internal successors, (277), 11 states have internal predecessors, (277), 6 states have call successors, (249), 3 states have call predecessors, (249), 5 states have return successors, (250), 6 states have call predecessors, (250), 6 states have call successors, (250) [2025-03-03 20:08:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 43606 states and 71064 transitions. [2025-03-03 20:08:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-03-03 20:08:45,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:45,958 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:45,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:08:46,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 20:08:46,159 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:46,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1370680520, now seen corresponding path program 1 times [2025-03-03 20:08:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373906033] [2025-03-03 20:08:46,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:46,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 20:08:46,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 20:08:46,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:46,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 1593 proven. 207 refuted. 0 times theorem prover too weak. 29200 trivial. 0 not checked. [2025-03-03 20:08:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373906033] [2025-03-03 20:08:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373906033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279754295] [2025-03-03 20:08:48,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:48,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:48,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:48,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:08:48,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 20:08:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 20:08:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 20:08:48,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 8114 proven. 207 refuted. 0 times theorem prover too weak. 22679 trivial. 0 not checked. [2025-03-03 20:08:49,993 INFO L312 TraceCheckSpWp]: Computing backward predicates...