./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.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 5db290f428815e90a4f018b6e59020b3b572c51fa983142ee856b69fd7fa99fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:18:36,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:18:36,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:18:36,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:18:36,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:18:36,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:18:36,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:18:36,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:18:36,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:18:36,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:18:36,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:18:36,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:18:36,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:18:36,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:18:36,155 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:18:36,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:18:36,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:18:36,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:18:36,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:18:36,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:18:36,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:18:36,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:18:36,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:18:36,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:18:36,158 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 -> 5db290f428815e90a4f018b6e59020b3b572c51fa983142ee856b69fd7fa99fb [2025-03-08 11:18:36,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:18:36,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:18:36,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:18:36,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:18:36,420 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:18:36,422 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-36.i [2025-03-08 11:18:37,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3989628/5a70ab789ea64238b6a364b87db4f9c6/FLAGbe7024c85 [2025-03-08 11:18:37,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:18:37,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-03-08 11:18:37,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3989628/5a70ab789ea64238b6a364b87db4f9c6/FLAGbe7024c85 [2025-03-08 11:18:38,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3989628/5a70ab789ea64238b6a364b87db4f9c6 [2025-03-08 11:18:38,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:18:38,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:18:38,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:18:38,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:18:38,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:18:38,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0d3c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38, skipping insertion in model container [2025-03-08 11:18:38,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:18:38,312 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-36.i[916,929] [2025-03-08 11:18:38,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:18:38,499 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:18:38,509 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-36.i[916,929] [2025-03-08 11:18:38,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:18:38,610 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:18:38,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38 WrapperNode [2025-03-08 11:18:38,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:18:38,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:18:38,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:18:38,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:18:38,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,708 INFO L138 Inliner]: procedures = 26, calls = 106, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-03-08 11:18:38,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:18:38,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:18:38,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:18:38,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:18:38,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,772 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:18:38,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:18:38,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:18:38,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:18:38,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:18:38,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (1/1) ... [2025-03-08 11:18:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:18:38,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:38,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:18:38,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:18:38,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:18:38,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:18:38,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:18:38,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:18:39,009 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:18:39,011 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:18:40,091 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:18:40,092 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:18:40,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:18:40,132 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 11:18:40,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:18:40 BoogieIcfgContainer [2025-03-08 11:18:40,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:18:40,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:18:40,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:18:40,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:18:40,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:18:38" (1/3) ... [2025-03-08 11:18:40,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22153ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:18:40, skipping insertion in model container [2025-03-08 11:18:40,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:38" (2/3) ... [2025-03-08 11:18:40,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22153ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:18:40, skipping insertion in model container [2025-03-08 11:18:40,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:18:40" (3/3) ... [2025-03-08 11:18:40,153 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-03-08 11:18:40,163 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:18:40,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-36.i that has 2 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:18:40,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:18:40,235 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;@4a31623b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:18:40,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:18:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 255 states have (on average 1.619607843137255) internal successors, (413), 256 states have internal predecessors, (413), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:18:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:40,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:40,268 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:40,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:40,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1060049068, now seen corresponding path program 1 times [2025-03-08 11:18:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341719621] [2025-03-08 11:18:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:40,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:40,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-03-08 11:18:40,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:40,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341719621] [2025-03-08 11:18:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341719621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:18:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916093852] [2025-03-08 11:18:40,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:40,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:18:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:40,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:18:40,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:18:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:41,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:41,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:41,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:41,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:18:41,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:18:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-03-08 11:18:41,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:18:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916093852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:18:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:18:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705605016] [2025-03-08 11:18:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:41,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:18:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:41,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:18:41,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:18:41,284 INFO L87 Difference]: Start difference. First operand has 351 states, 255 states have (on average 1.619607843137255) internal successors, (413), 256 states have internal predecessors, (413), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-03-08 11:18:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:41,389 INFO L93 Difference]: Finished difference Result 693 states and 1281 transitions. [2025-03-08 11:18:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:18:41,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) Word has length 608 [2025-03-08 11:18:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:41,401 INFO L225 Difference]: With dead ends: 693 [2025-03-08 11:18:41,401 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 11:18:41,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:18:41,410 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:41,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 11:18:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-08 11:18:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 250 states have (on average 1.604) internal successors, (401), 250 states have internal predecessors, (401), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 11:18:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 587 transitions. [2025-03-08 11:18:41,487 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 587 transitions. Word has length 608 [2025-03-08 11:18:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:41,488 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 587 transitions. [2025-03-08 11:18:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-03-08 11:18:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 587 transitions. [2025-03-08 11:18:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:41,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:41,505 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:41,514 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-08 11:18:41,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:18:41,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:41,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1011260203, now seen corresponding path program 1 times [2025-03-08 11:18:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:41,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633291644] [2025-03-08 11:18:41,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:41,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:41,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:41,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:41,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:41,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633291644] [2025-03-08 11:18:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633291644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:42,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979491851] [2025-03-08 11:18:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:42,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:42,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:42,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:42,420 INFO L87 Difference]: Start difference. First operand 345 states and 587 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:42,569 INFO L93 Difference]: Finished difference Result 920 states and 1575 transitions. [2025-03-08 11:18:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:42,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:42,579 INFO L225 Difference]: With dead ends: 920 [2025-03-08 11:18:42,579 INFO L226 Difference]: Without dead ends: 578 [2025-03-08 11:18:42,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:42,581 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 403 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:42,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1348 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-08 11:18:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-03-08 11:18:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.6481069042316259) internal successors, (740), 450 states have internal predecessors, (740), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-08 11:18:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 986 transitions. [2025-03-08 11:18:42,631 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 986 transitions. Word has length 608 [2025-03-08 11:18:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:42,632 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 986 transitions. [2025-03-08 11:18:42,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 986 transitions. [2025-03-08 11:18:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:42,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:42,640 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:42,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:18:42,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1131380076, now seen corresponding path program 1 times [2025-03-08 11:18:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299618605] [2025-03-08 11:18:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:42,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:42,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:42,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:42,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:42,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299618605] [2025-03-08 11:18:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299618605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:42,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385487889] [2025-03-08 11:18:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:42,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:42,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:42,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:42,946 INFO L87 Difference]: Start difference. First operand 575 states and 986 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:43,056 INFO L93 Difference]: Finished difference Result 1601 states and 2756 transitions. [2025-03-08 11:18:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:43,065 INFO L225 Difference]: With dead ends: 1601 [2025-03-08 11:18:43,068 INFO L226 Difference]: Without dead ends: 1029 [2025-03-08 11:18:43,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:43,072 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 380 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:43,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1092 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-08 11:18:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-03-08 11:18:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 849 states have (on average 1.6772673733804475) internal successors, (1424), 852 states have internal predecessors, (1424), 171 states have call successors, (171), 4 states have call predecessors, (171), 4 states have return successors, (171), 168 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-08 11:18:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1766 transitions. [2025-03-08 11:18:43,150 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1766 transitions. Word has length 608 [2025-03-08 11:18:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:43,152 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1766 transitions. [2025-03-08 11:18:43,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1766 transitions. [2025-03-08 11:18:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:43,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:43,165 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:43,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:18:43,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:43,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash -676467445, now seen corresponding path program 1 times [2025-03-08 11:18:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329041433] [2025-03-08 11:18:43,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:43,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:43,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:43,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329041433] [2025-03-08 11:18:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329041433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756561818] [2025-03-08 11:18:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:43,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:43,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:43,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:43,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:43,406 INFO L87 Difference]: Start difference. First operand 1025 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:43,506 INFO L93 Difference]: Finished difference Result 2690 states and 4621 transitions. [2025-03-08 11:18:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:43,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:43,515 INFO L225 Difference]: With dead ends: 2690 [2025-03-08 11:18:43,515 INFO L226 Difference]: Without dead ends: 1668 [2025-03-08 11:18:43,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:43,518 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 313 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:43,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1239 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-08 11:18:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1665. [2025-03-08 11:18:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1365 states have (on average 1.6600732600732602) internal successors, (2266), 1372 states have internal predecessors, (2266), 291 states have call successors, (291), 8 states have call predecessors, (291), 8 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2025-03-08 11:18:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2848 transitions. [2025-03-08 11:18:43,608 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2848 transitions. Word has length 608 [2025-03-08 11:18:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:43,609 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2848 transitions. [2025-03-08 11:18:43,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2848 transitions. [2025-03-08 11:18:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:43,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:43,616 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:43,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:18:43,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:43,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 92702570, now seen corresponding path program 1 times [2025-03-08 11:18:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024140608] [2025-03-08 11:18:43,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:43,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:43,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:43,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:43,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024140608] [2025-03-08 11:18:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024140608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449643712] [2025-03-08 11:18:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:43,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:43,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:43,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:43,896 INFO L87 Difference]: Start difference. First operand 1665 states and 2848 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:44,028 INFO L93 Difference]: Finished difference Result 4833 states and 8274 transitions. [2025-03-08 11:18:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:44,042 INFO L225 Difference]: With dead ends: 4833 [2025-03-08 11:18:44,043 INFO L226 Difference]: Without dead ends: 3171 [2025-03-08 11:18:44,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:44,047 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 370 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:44,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2025-03-08 11:18:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3167. [2025-03-08 11:18:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2627 states have (on average 1.6627331556909022) internal successors, (4368), 2642 states have internal predecessors, (4368), 523 states have call successors, (523), 16 states have call predecessors, (523), 16 states have return successors, (523), 508 states have call predecessors, (523), 523 states have call successors, (523) [2025-03-08 11:18:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 5414 transitions. [2025-03-08 11:18:44,170 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 5414 transitions. Word has length 608 [2025-03-08 11:18:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:44,171 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 5414 transitions. [2025-03-08 11:18:44,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 5414 transitions. [2025-03-08 11:18:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:44,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:44,198 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:44,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:18:44,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:44,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash -291084597, now seen corresponding path program 1 times [2025-03-08 11:18:44,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:44,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692434534] [2025-03-08 11:18:44,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:44,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:44,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:44,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:44,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692434534] [2025-03-08 11:18:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692434534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:44,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:44,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:44,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202164268] [2025-03-08 11:18:44,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:44,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:44,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:44,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:44,392 INFO L87 Difference]: Start difference. First operand 3167 states and 5414 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:44,607 INFO L93 Difference]: Finished difference Result 9415 states and 16100 transitions. [2025-03-08 11:18:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:44,663 INFO L225 Difference]: With dead ends: 9415 [2025-03-08 11:18:44,664 INFO L226 Difference]: Without dead ends: 6251 [2025-03-08 11:18:44,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:44,670 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 561 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:44,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1114 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2025-03-08 11:18:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2025-03-08 11:18:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 5170 states have (on average 1.6502901353965185) internal successors, (8532), 5200 states have internal predecessors, (8532), 1046 states have call successors, (1046), 32 states have call predecessors, (1046), 32 states have return successors, (1046), 1016 states have call predecessors, (1046), 1046 states have call successors, (1046) [2025-03-08 11:18:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 10624 transitions. [2025-03-08 11:18:44,947 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 10624 transitions. Word has length 608 [2025-03-08 11:18:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 6249 states and 10624 transitions. [2025-03-08 11:18:44,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 10624 transitions. [2025-03-08 11:18:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:44,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:44,958 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:18:44,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1434533622, now seen corresponding path program 1 times [2025-03-08 11:18:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239125117] [2025-03-08 11:18:44,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:44,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:45,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:45,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239125117] [2025-03-08 11:18:45,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239125117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884595462] [2025-03-08 11:18:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:45,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:45,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:45,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:45,174 INFO L87 Difference]: Start difference. First operand 6249 states and 10624 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:45,421 INFO L93 Difference]: Finished difference Result 12507 states and 21254 transitions. [2025-03-08 11:18:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:45,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:45,450 INFO L225 Difference]: With dead ends: 12507 [2025-03-08 11:18:45,450 INFO L226 Difference]: Without dead ends: 6261 [2025-03-08 11:18:45,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-08 11:18:45,461 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 270 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:45,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1230 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6261 states. [2025-03-08 11:18:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6261 to 5005. [2025-03-08 11:18:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5005 states, 4412 states have (on average 1.6858567543064369) internal successors, (7438), 4426 states have internal predecessors, (7438), 574 states have call successors, (574), 18 states have call predecessors, (574), 18 states have return successors, (574), 560 states have call predecessors, (574), 574 states have call successors, (574) [2025-03-08 11:18:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 8586 transitions. [2025-03-08 11:18:45,730 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 8586 transitions. Word has length 608 [2025-03-08 11:18:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:45,731 INFO L471 AbstractCegarLoop]: Abstraction has 5005 states and 8586 transitions. [2025-03-08 11:18:45,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 8586 transitions. [2025-03-08 11:18:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:45,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:45,743 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:45,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:18:45,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash -81223925, now seen corresponding path program 1 times [2025-03-08 11:18:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461832677] [2025-03-08 11:18:45,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:45,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:45,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:45,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:45,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:46,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:46,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461832677] [2025-03-08 11:18:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461832677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:46,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:46,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:18:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097366845] [2025-03-08 11:18:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:46,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:18:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:46,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:18:46,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:18:46,229 INFO L87 Difference]: Start difference. First operand 5005 states and 8586 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:47,965 INFO L93 Difference]: Finished difference Result 27825 states and 47606 transitions. [2025-03-08 11:18:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:18:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:48,039 INFO L225 Difference]: With dead ends: 27825 [2025-03-08 11:18:48,039 INFO L226 Difference]: Without dead ends: 22823 [2025-03-08 11:18:48,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:18:48,055 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 2460 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:48,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 2679 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:18:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22823 states. [2025-03-08 11:18:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22823 to 18560. [2025-03-08 11:18:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18560 states, 16530 states have (on average 1.6834845735027224) internal successors, (27828), 16593 states have internal predecessors, (27828), 1940 states have call successors, (1940), 89 states have call predecessors, (1940), 89 states have return successors, (1940), 1877 states have call predecessors, (1940), 1940 states have call successors, (1940) [2025-03-08 11:18:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 31708 transitions. [2025-03-08 11:18:48,838 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 31708 transitions. Word has length 608 [2025-03-08 11:18:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 18560 states and 31708 transitions. [2025-03-08 11:18:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 31708 transitions. [2025-03-08 11:18:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:48,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:48,869 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:18:48,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash -689300788, now seen corresponding path program 1 times [2025-03-08 11:18:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305562673] [2025-03-08 11:18:48,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:48,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:48,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:49,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:49,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305562673] [2025-03-08 11:18:49,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305562673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:49,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:49,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:18:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118365606] [2025-03-08 11:18:49,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:49,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:18:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:49,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:18:49,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:18:49,176 INFO L87 Difference]: Start difference. First operand 18560 states and 31708 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:50,037 INFO L93 Difference]: Finished difference Result 50315 states and 86010 transitions. [2025-03-08 11:18:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:18:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:50,118 INFO L225 Difference]: With dead ends: 50315 [2025-03-08 11:18:50,119 INFO L226 Difference]: Without dead ends: 31805 [2025-03-08 11:18:50,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:18:50,156 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 775 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:50,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2138 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:18:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31805 states. [2025-03-08 11:18:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31805 to 23035. [2025-03-08 11:18:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23035 states, 20497 states have (on average 1.6803922525247597) internal successors, (34443), 20576 states have internal predecessors, (34443), 2422 states have call successors, (2422), 115 states have call predecessors, (2422), 115 states have return successors, (2422), 2343 states have call predecessors, (2422), 2422 states have call successors, (2422) [2025-03-08 11:18:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23035 states to 23035 states and 39287 transitions. [2025-03-08 11:18:51,023 INFO L78 Accepts]: Start accepts. Automaton has 23035 states and 39287 transitions. Word has length 608 [2025-03-08 11:18:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:51,024 INFO L471 AbstractCegarLoop]: Abstraction has 23035 states and 39287 transitions. [2025-03-08 11:18:51,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23035 states and 39287 transitions. [2025-03-08 11:18:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:51,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:51,058 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:51,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:18:51,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:51,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1751737494, now seen corresponding path program 1 times [2025-03-08 11:18:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89050356] [2025-03-08 11:18:51,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:51,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:51,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:51,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:51,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:51,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89050356] [2025-03-08 11:18:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89050356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:51,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:51,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:18:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927567726] [2025-03-08 11:18:51,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:18:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:18:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:18:51,717 INFO L87 Difference]: Start difference. First operand 23035 states and 39287 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:54,332 INFO L93 Difference]: Finished difference Result 101949 states and 173935 transitions. [2025-03-08 11:18:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:18:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-03-08 11:18:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:54,550 INFO L225 Difference]: With dead ends: 101949 [2025-03-08 11:18:54,550 INFO L226 Difference]: Without dead ends: 78987 [2025-03-08 11:18:54,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:18:54,601 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 1751 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:54,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2441 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:18:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78987 states. [2025-03-08 11:18:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78987 to 55631. [2025-03-08 11:18:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55631 states, 50595 states have (on average 1.6946931514971835) internal successors, (85743), 50752 states have internal predecessors, (85743), 4808 states have call successors, (4808), 227 states have call predecessors, (4808), 227 states have return successors, (4808), 4651 states have call predecessors, (4808), 4808 states have call successors, (4808) [2025-03-08 11:18:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55631 states to 55631 states and 95359 transitions. [2025-03-08 11:18:56,813 INFO L78 Accepts]: Start accepts. Automaton has 55631 states and 95359 transitions. Word has length 608 [2025-03-08 11:18:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:56,814 INFO L471 AbstractCegarLoop]: Abstraction has 55631 states and 95359 transitions. [2025-03-08 11:18:56,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-03-08 11:18:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 55631 states and 95359 transitions. [2025-03-08 11:18:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:18:56,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:56,868 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:56,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:18:56,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 160381703, now seen corresponding path program 1 times [2025-03-08 11:18:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810173820] [2025-03-08 11:18:56,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:56,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:18:56,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:18:56,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:56,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:18:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810173820] [2025-03-08 11:18:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810173820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:57,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:18:57,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162880318] [2025-03-08 11:18:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:57,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:18:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:57,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:18:57,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:18:57,767 INFO L87 Difference]: Start difference. First operand 55631 states and 95359 transitions. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 3 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) [2025-03-08 11:19:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:04,768 INFO L93 Difference]: Finished difference Result 255409 states and 436449 transitions. [2025-03-08 11:19:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:19:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 3 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) Word has length 608 [2025-03-08 11:19:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:05,270 INFO L225 Difference]: With dead ends: 255409 [2025-03-08 11:19:05,271 INFO L226 Difference]: Without dead ends: 199851 [2025-03-08 11:19:05,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:19:05,386 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 5519 mSDsluCounter, 3823 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5519 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:05,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5519 Valid, 4820 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 11:19:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199851 states. [2025-03-08 11:19:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199851 to 158033. [2025-03-08 11:19:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158033 states, 143350 states have (on average 1.686041158004883) internal successors, (241694), 143827 states have internal predecessors, (241694), 13984 states have call successors, (13984), 698 states have call predecessors, (13984), 698 states have return successors, (13984), 13507 states have call predecessors, (13984), 13984 states have call successors, (13984) [2025-03-08 11:19:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158033 states to 158033 states and 269662 transitions. [2025-03-08 11:19:12,335 INFO L78 Accepts]: Start accepts. Automaton has 158033 states and 269662 transitions. Word has length 608 [2025-03-08 11:19:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:12,336 INFO L471 AbstractCegarLoop]: Abstraction has 158033 states and 269662 transitions. [2025-03-08 11:19:12,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 3 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) [2025-03-08 11:19:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158033 states and 269662 transitions. [2025-03-08 11:19:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 11:19:12,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:12,457 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:12,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:19:12,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2014298394, now seen corresponding path program 1 times [2025-03-08 11:19:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801378129] [2025-03-08 11:19:12,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:12,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 11:19:12,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 11:19:12,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:12,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-03-08 11:19:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801378129] [2025-03-08 11:19:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801378129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:19:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769010421] [2025-03-08 11:19:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:19:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:13,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:19:13,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:19:13,999 INFO L87 Difference]: Start difference. First operand 158033 states and 269662 transitions. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 2 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 2 states have call predecessors, (93), 2 states have call successors, (93)